Cryptanalysts representation of nonlinearly filtered ML-sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Fast correlation attacks on certain stream ciphers
Journal of Cryptology
A fast correlation attack on nonlinearly feedforward filtered shift-register sequences
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions
IEEE Transactions on Computers
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
Designs, Codes and Cryptography
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Revisiting correlation-immunity in filter generators
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Constructions of cryptographically significant boolean functions using primitive polynomials
IEEE Transactions on Information Theory
Designs, Codes and Cryptography
Construction and analysis of boolean functions of 2t+1 variables with maximum algebraic immunity
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Open problems related to algebraic attacks on stream ciphers
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
On the algebraic immunity of symmetric boolean functions
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Algebraic attacks on combiners with memory and several outputs
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
IEEE Transactions on Information Theory
A New Attack on the Filter Generator
IEEE Transactions on Information Theory
Secondary constructions of Boolean functions with maximum algebraic immunity
Cryptography and Communications
| Hi-index | 0.02 |
In this paper the possibilities of an iterative concatenation method towards construction of Boolean functions resistant to algebraic cryptanalysis are investigated. The notion of $\mathcal{AAR}$ (Algebraic Attack Resistant) function is introduced as a unified measure of protection against classical algebraic attacks as well as fast algebraic attacks. Then, it is shown that functions that posses the highest resistance to fast algebraic attacks are necessarily of maximum algebraic immunity, thus opposing a maximum resistance to algebraic cryptanalysis in general. The developed theoretical framework allows us to iteratively construct functions with maximum $\mathcal{AI}$ , and of almost optimized resistance to fast algebraic cryptanalysis. This infinite class for the first time, apart from almost optimal resistance to algebraic cryptanalysis, in addition generates functions that allow an extremely efficient hardware implementation, possess high nonlinearity and maximum algebraic degree; thus unifying most of the relevant cryptographic criteria.