Fast Software Encryption
From MaRDI portal
Publication:5713929
DOI10.1007/b98177zbMath1079.68536OpenAlexW2485295499MaRDI QIDQ5713929
Publication date: 27 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98177
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)
Related Items
On the fast algebraic immunity of threshold functions ⋮ Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions ⋮ Cryptanalysis of WG-7: a lightweight stream cipher ⋮ Basic theory in construction of Boolean functions with maximum possible annihilator immunity ⋮ Algebraic attacks on a class of stream ciphers with unknown output function ⋮ Boolean functions optimizing most of the cryptographic criteria ⋮ Using small-scale quantum devices to solve algebraic equations ⋮ A Note on the Optimal Immunity of Boolean Functions Against Fast Algebraic Attacks ⋮ A combinatorial condition and Boolean functions with optimal algebraic immunity ⋮ On extended algebraic immunity ⋮ On Computing the Immunity of Boolean Power Functions Against Fast Algebraic Attacks ⋮ Algebraic immunity for cryptographically significant Boolean functions: analysis and construction ⋮ A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation ⋮ The Tu-Deng conjecture holds almost surely ⋮ Enhanced Boolean functions suitable for the filter model of pseudo-random generator ⋮ Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks ⋮ Algebraic cryptanalysis of stream ciphers using decomposition of Boolean function ⋮ Improving algebraic attacks on stream ciphers based on linear feedback shift register over \(\mathbb{F}_{2^k}\) ⋮ A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code ⋮ On the \(2^{m}\)-variable symmetric Boolean functions with maximum algebraic immunity ⋮ A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity ⋮ On some algorithms for constructing low-degree annihilators for Boolean functions ⋮ Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks ⋮ Weight Support Technique and the Symmetric Boolean Functions with Maximum Algebraic Immunity on Even Number of Variables ⋮ An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity ⋮ Sequences, DFT and Resistance against Fast Algebraic Attacks ⋮ Hybrid classes of balanced Boolean functions with good cryptographic properties ⋮ Further properties of several classes of Boolean functions with optimum algebraic immunity ⋮ Maximal values of generalized algebraic immunity ⋮ On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\) ⋮ On the immunity of rotation symmetric Boolean functions against fast algebraic attacks ⋮ Cryptanalysis of an E0-like combiner with memory ⋮ An algorithm for the spectral immunity of binary sequence with period 2 n ⋮ New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions ⋮ On \((2^{m}+1)\)-variable symmetric Boolean functions with submaximum algebraic immunity \(2^{m - 1}\) ⋮ Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
