Results 11 to 20 of about 17,540 (147)
More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks [PDF]
IEEE Transactions on Information Theory, 2011 In this paper, three constructions of balanced Boolean functions with optimal algebraic immunity are proposed. It is checked that, at least for small numbers of input variables, these functions have good behavior against fast algebraic attacks as well. Other cryptographic properties such as algebraic degree and nonlinearity of the constructed functions
Xiangyong Zeng +3 more
openaire +3 more sources
A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions
IEEE Access, 2019 Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually calculated by the ...
Yindong Chen +3 more
doaj +3 more sources
On the immunity of rotation symmetric Boolean functions against fast algebraic attacks
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Yin, Liu, Meicheng, Lin, Dongdai
openaire +4 more sources
Fast Algebraic Immunity of
IEEE Access, 2019 Boolean functions should possess high fast algebraic immunity (FAI) when it is used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the FAI of Boolean functions was usually calculated by computer.
Yindong Chen +3 more
doaj +1 more source
Constructing Two Classes of Boolean Functions With Good Cryptographic Properties
IEEE Access, 2019 Wu et al. proposed a generalized Tu-Deng conjecture over $\mathbb {F}_{2^{rm}}\times {\mathbb {F}_{2^{m}}}$ , and constructed Boolean functions with good properties. However the proof of the generalized conjecture is still open.
Yindong Chen +3 more
doaj +1 more source
IEEE Access, 2020 In this paper, a novel scheme for secure audio transmission is introduced. The novelty of this scheme is that it combines four different techniques for audio encryption in the same scheme which makes it more secure: self-adaptive scrambling, multi ...
Roayat Ismail Abdelfatah
doaj +1 more source
Wave-Shaped Round Functions and Primitive Groups [PDF]
, 2018 Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the composition of different layers which provide confusion and diffusion, and key ...
Aragona, Riccardo +4 more
core +2 more sources
Survey and Benchmark of Block Ciphers for Wireless Sensor Networks [PDF]
, 2006 Cryptographic algorithms play an important role in the security architecture of wireless sensor networks (WSNs). Choosing the most storage- and energy-efficient block cipher is essential, due to the facts that these networks are meant to operate without ...
Doumen, J.M., Hartel, P.H., Law, Y.W.
core +3 more sources
Single Trace Side Channel Analysis on NTRU Implementation
Applied Sciences, 2018 As researches on the quantum computer have progressed immensely, interests in post-quantum cryptography have greatly increased. NTRU is one of the well-known algorithms due to its practical key sizes and fast performance along with the resistance against
Soojung An +4 more
doaj +1 more source
On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes [PDF]
, 2013 . Universal hash functions are commonly used primitives for fast and secure message authentication in the form of Message Authentication Codes (MACs) or Authenticated Encryption with Associated Data (AEAD) schemes.
B Boer den +22 more
core +8 more sources