Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
LOKI—a cryptographic primitive for authentication and secrecy applications
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
Counting functions satisfying a higher order strict avalanche criterion
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Non-linearity of exponent permutations
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Structured Design of Substitution-Permutation Encryption Networks
IEEE Transactions on Computers
Proceedings of the 1982 conference on Cryptography
Linear Frameworks for Block Ciphers
Designs, Codes and Cryptography
Avalanche Characteristics of Substitution-Permutation Encryption Networks
IEEE Transactions on Computers
An evolutionary algorithm to improve the nonlinearity of self-inverse s-boxes
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
S(ubstitution)-boxes are quite important components of modern symmetric cryptosystems. S-boxes bring nonlinearity to cryptosystems and strengthen their cryptographic security. An S-box satisfies the strict avalanche criterion (SAC), if and only if for any single input bit of the S-box, the inversion of it changes each output bit with probability one half. We present some interesting properties of S-boxes and propose an efficient and systematic means of generating arbitrary input size bijective S-boxes satisfying the SAC by applying simple rules recursively given 3-bit input bijective S-box(es) satisfying the SAC.