Perfect nonlinear S-boxes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 547 LNCS, Issue , 1991, Pages 378-386

  Nyberg, Kaisa ^a  

^a FINNISH DEFENCE FORCES   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BENT FUNCTION; CONSTRUCTION METHOD; DIFFERENCE SETS; DIFFERENTIAL CRYPTANALYSIS; DIRECTIONAL DERIVATIVE; INPUT VARIABLES; OUTPUT VARIABLES; S-BOXES;

MATHEMATICAL TRANSFORMATIONS;

EID: 85030461165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46416-6_32     Document Type: Conference Paper

References (17)

1. C. M. Adams and S. E. Tavares, The use of bent sequences to achieve higher-order strict avalanche criterion in S-box design, IEE Proceedings (to appear).
2. E. Biham and A. Shamir, Differential cryptanalysis of DBS-like cryptosystems, Proceedings of Crypto’90 (to appear).
3. D. Chaum and J. H. Evertse, Cryptanalysis of DES with a reduced number of rounds, Advances in Cryptology, Proceedings of Crypto’85, Springer-Verlag 1986, 192-211.
4. M. H. Dawson and S. E. Tavares, An expanded set of s-box design criteria based on information theory and its relation to differential-like attacks, These Proceedings.
5. J. Denes and A. D. Keedwell, “Latin squares and their applications,” The English Universities Press Ltd, London, 1974.
6. J. F. Dillon, Elementary Hadamard difference sets, Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida (1975), 237-249; Congressus Numerantium No. XIV, Utilitas Math., Winnipeg, Manitoba (1975).
7. P. V. Kumar, R. A. Scholtz and L. R. Welch, Generalized bent functions and their properties, J. Combinatorial Theory, Ser. A 40 (1985), 90-107.
8. A. Lempel and M. Cohn, Maximal families of bent sequences, IEEE Trans. Inform. Theory IT-28 (1982), 865-868.
9. H. Lidl and H. Niederreiter, “Finite fields. Encyclopedia of Mathematics and its applications, Vol. 20,” Addison-Wesley, Reading, Massachusetts, 1983.
10. H. B. Mann, The construction of orthogonal Latin squares, Ann. Math. Statist. 13 (1942), 418-423.
11. R. L. McFarland, A family of difference sets in non-cyclic groups, J. Combinatorial Theory, Ser. A 15 (1973), 1-10.
12. W. Meier and O. Staffelbach, Nonlinearity criteria for cryptographic functions, Proceedings of Eurocrypt’89, Springer 1990, 549-562.
13. K. Nyberg, Constructions of bent functions and difference sets, Proceedings of Eurocrypt’90, Springer-Verlag 1991, 151-160.
14. B. Preneel et al., Propagation characteristics of Boolean bent functions, Proceedings of Eurocrypt’90, Springer-Verlag 1991, 161-173.
15. O. S. Rothaus, On "bent” functions, J. Combinatorial Theory, Ser. A 20 (1976), 300-305.
16. R. A. Rueppel, Stream Ciphers, in “Contemporary Cryptology: The Science of Information Integrity,” edited by Gustavus Simmons, IEEE Press (to appear).
17. R. Yarlagadda and J. E. Hershey, Analysis and synthesis of bent sequences, IEE Proceedings 136 (1989), 112-123.