Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES
CRYPTO '98 Proceedings of the 18th 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
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
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
An analysis of the XSL algorithm
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
IEEE Transactions on Information Theory
On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Some lower bounds on the algebraic immunity of functions given by their trace forms
Problems of Information Transmission
Algebraic Description and Simultaneous Linear Approximations of Addition in Snow 2.0.
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Maximal values of generalized algebraic immunity
Designs, Codes and Cryptography
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
On extended algebraic immunity
Designs, Codes and Cryptography
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
Algebraic immunity of S-boxes and augmented functions
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
| Hi-index | 0.08 |
The aim of this paper is to construct boolean functions $f:\{0,1\}^n\longrightarrow\{0,1\}^m$, for which the graph gr(f)={(x,f(x)),x∈{0,1}n}⊆{0,1}n+m has maximal algebraic immunity. This research is motivated by the need for appropriate boolean functions serving as building blocks of symmetric ciphers. Such functions should have large algebraic immunity for preventing vulnerability of the cipher against algebraic attacks. We completely solve the problem of constructing explicitely defined single-output functions for which the graph has maximal algebraic immunity. Concerning multi-output functions, we present an efficient algorithm, based on matroid union, which computes for given m,n,d the table of a function $h:\{0,1\}^n\longrightarrow\{0,1\}^m$ for which the algebraic immunity of the graph is greater than d. To the best of our knowledge, this is the first systematic method for constructing multi-output functions of high algebraic immunity