Analysis and design of stream ciphers
Analysis and design of stream ciphers
Pseudo random properties of cascade connections of clock controlled shift registers
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
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
A survey of recent attacks on the filter generator
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On attacks on filtering generators using linear subspace structures
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Introducing a new variant of fast algebraic attacks and minimizing their successive data complexity
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Upper bounds on algebraic immunity of boolean power functions
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
On the higher order nonlinearities of algebraic immune functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On cryptographic properties of the cosets of R(1, m)
IEEE Transactions on Information Theory
A New Attack on the Filter Generator
IEEE Transactions on Information Theory
Information Security and Cryptology --- ICISC 2008
On the resistance of boolean functions against fast algebraic attacks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Perfect algebraic immune functions
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
The discrete Fourier transform (DFT) of a boolean function yields a trace representation or equivalently, a polynomial representation, of the boolean function, which is identical to the DFT of the sequence associated with the boolean function. Using this tool, we investigate characterizations of boolean functions for which the fast algebraic attack is applicable. In order to apply the fast algebraic attack, the question that needs to be answered is that: for a given boolean function fin nvariables and a pair of positive integers (d, e), when there exists a function gwith degree at most dsuch that $h=fg\ne 0$ where h's degree is at most e. We give a sufficient and necessary condition for the existence of those multipliers of f. An algorithm for finding those multipliers is given in terms of a polynomial basis of 2ndimensional space over $\mathbb{F}_2$ which is established by an arbitrary m-sequence of period 2n茂戮驴 1 together with all its decimations and certain shifts. We then provide analysis for degenerated cases and introduce a new concept of resistance against the fast algebraic attack in terms of the DFT of sequences or boolean functions. Some functions which made the fast algebraic attack inefficient are identified.