Results 41 to 50 of about 12,980 (220)
Complex & Intelligent Systems, 2023 Robustness of modern information confidentiality algorithm depends on its individual components. Modern block ciphers highly depend on two components namely confusion and diffusion.
Nabilah Abughazalah +2 more
doaj +1 more source
A Substitution Box for Lightweight Ciphers to Secure Internet of Things
Journal of King Saud University: Computer and Information Sciences, 2023 The Internet of Things is a resource-constrained device that demands lightweight cryptographic solutions to achieve high performance and optimal security.
V. Panchami, Mahima Mary Mathews
doaj +1 more source
Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI
IEEE Access, 2019 Rotation symmetric Boolean functions (RSBFs) are nowadays studied a lot because of its easy operations and good performance in cryptosystem. This paper constructs a new class of odd-variable RSBFs with optimal algebraic immunity (AI). The nonlinearity of
Yindong Chen +5 more
doaj +1 more source
Resolute refinements of social choice correspondences [PDF]
, 2016 Many classical social choice correspondences are resolute only in the case of two alternatives and an odd number of individuals. Thus, in most cases, they admit several resolute refinements, each of them naturally interpreted as a tie-breaking rule ...
Bubboloni, Daniela, Gori, Michele
core +2 more sources
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
, 2009 Algebraic and fast algebraic attacks are power tools to analyze stream ciphers. A class of symmetric Boolean functions with maximum algebraic immunity were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the notion of AAR (algebraic
Lin Dongdai, Liu Meicheng, Pei Dingyi
core +1 more source
S-matrix elements for gauge theories with and without implemented constraints [PDF]
, 1996 We derive an expression for the relation between two scattering transition amplitudes which reflect the same dynamics, but which differ in the description of their initial and final state vectors.
F. Bloch +8 more
core +2 more sources
New bound of algebraic immunity of a class of Boolean function
Tongxin xuebao, 2016 Algebraic immunity quantified the resistance of a Boolean function to the algebraic attack.Recently,Mesnager,et al showed that there were direct linked between the annihilators used in algebraic attacks and the coding theory.They showed that the lower ...
Ye TIAN +3 more
doaj +2 more sources
The use of a formal sensitivity analysis on epidemic models with immune protection from maternally acquired antibodies [PDF]
, 2011 This paper considers the outcome of a formal sensitivity analysis on a series of epidemic model structures developed to study the population level effects of maternal antibodies.
Chapman, James D. +2 more
core +1 more source
Fast algebraic immunity of Boolean functions
Advances in Mathematics of Communications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mesnager, Sihem, Cohen, Gérard
openaire +3 more sources
Boolean functions with restricted input and their robustness; application to the FLIP cipher
IACR Transactions on Symmetric Cryptology, 2017 We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number n of variables, the input to these functions is restricted to some subset E ...
Claude Carlet +2 more
doaj +1 more source