Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On immunity against Biham and Shamir's “differential cryptanalysis”
Information Processing Letters
The Design of Rijndael
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
On Resilient Boolean Functions with Maximal Possible Nonlinearity
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
On Relationships among Avalanche, Nonlinearity, and Correlation Immunity
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: 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
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
On cryptographic properties of the cosets of R(1, m)
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions
Finite Fields and Their Applications
Cryptographically Strong S-Boxes Based on Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Designing cryptographically strong S-boxes with the use of cellular automata
Annales UMCS, Informatica
| Hi-index | 0.00 |
In this paper we investigate several issues for equivalence classes of Boolean functions which are interesting for cryptology. As well as reviewing the established concepts, we present three new applications of these ideas. Firstly we propose a novel yet natural extension to the existing transform based equivalence class distinguishing algorithm, which can provide improved performance. Secondly, making novel use of the class graph notion, we completely explain the required conditions for high nonlinearity in the concatenation construction of Boolean functions. Finally, we use the linear class graph to comment on algebraic attacks by defining all the equivalence classes possible for the important set of annihilating functions. This approach provides a new solution to the problem of finding (and avoiding) low degree annihilators.