Correlation immunity and the summation generator
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A proposal for a new block encryption standard
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Using Strassen's algorithm to accelerate the solution of linear systems
The Journal of Supercomputing
Correlation properties of combiners with memory in stream ciphers
Journal of Cryptology - Eurocrypt '90
On an improved summation generator with 2-bit memory
Signal Processing
Parallel stream cipher for secure high-speed communications
Signal Processing
Cryptoanalysis Based on 2-Adic Rational Approximation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Differential Cryptanalysis and Design of Natural Stream Ciphers
Fast Software Encryption, Cambridge Security Workshop
SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm
Fast Software Encryption, Cambridge Security Workshop
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Higher order correlation attacks, XL algorithm and cryptanalysis of Toyocrypt
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Fault attacks on combiners with memory
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Sosemanuk, a Fast Software-Oriented Stream Cipher
New Stream Cipher Designs
| Hi-index | 0.00 |
Compact formulas are derived to represent the Algebraic Normal Form (ANF) of $f(\bar{x} + \bar{a}~mod~2^{n})$ and $f(\bar{x} \times \bar{a}~mod~2^{n})$ from the ANF of f, where f is a Boolean function on $\mathbb{F}^{n}_{2}$ and $\bar{a}$ is a constant of $\mathbb{F}^{n}_{2}$. We compare the algebraic degree of the composed functions with the algebraic degree of the original function f. As an application, the formula for addition modulo 2n is applied in an algebraic attack on the summation generator and the E0 encryption scheme in the Bluetooth keystream generator.