On cryptographically secure vectorial boolean functions

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

Volumn 1716, Issue , 1999, Pages 1-9

  Satoh, Takashi ^a   Iwata, Tetsu ^b   Kurosawa, Kaoru ^b  

^a UNIVERSITY OF KITAKYUSHU   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; SECURITY OF DATA;

BENT FUNCTION; OUTPUT BITS; VECTORIAL BOOLEAN FUNCTION;

CRYPTOGRAPHY;

EID: 84956868860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. J.F. Dillon. Elementary Hadamard difference sets. In The Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, pages 237–249, 1975. 22
2. C.Ding G.Xiao and W.Shan. The stability theory of stream ciphers. Lecture Notes in Computer Science 561, Springer-Verlag, 1991. 20, 21
3. H. Dobbertin. Construction of bent functions and balanced Boolean functions with high nonlinearity. In Fast Software Encryption, volume 1008 of Lecture Notes in Computer Science, pages 61–74, Springer-Verlag, 1995. 20, 21, 25
4. T. Jakobsen and L. R. Knudsen. The interpolation attack on block ciphers. In Fast Software Encryption, volume 1267 of Lecture Notes in Computer Science, pages 28–40, Springer-Verlag, 1997. 21
5. F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North-Holland Publishing Company, 1977. 20, 21, 22, 24
6. M. Matsui. Linear cryptanalysis method for DES cipher. In Advances in Cryptol-ogy —EUROCRYPT’93 Proceedings, volume 765 of Lecture Notes in Computer Science, pages 386-397, Springer-Verlag, 1994. 20, 21
7. K. Nyberg. Perfect nonlinear S-boxes. In Advances in Cryptology —EUROCRYPT’91 Proceedings, volume 547 of Lecture Notes in Computer Science, pages 378–386, Springer-Verlag, 1991. 20, 21, 22
8. K. Nyberg. On the construction of highly nonlinear permutations. In Advances in Cryptology —EUROCRYPT’92 Proceedings, volume 658 of Lecture Notes in Computer Science, pages 92–98, Springer-Verlag, 1993. 20, 21, 25
9. O. S. Rothaus. On bent functions. In Journal of Combinatorial Theory (A), 20:300–305, 1976. 20, 21
10. J. Seberry, X.M. Zhang and Y. Zheng. Nonlinearity and propagation characteristics of balanced Boolean functions. In Information and Computation, 119(1):1–13, May 1995. 20, 21, 25
11. X.M. Zhang and Y. Zheng. Cryptographically resilient functions. In IEEE Transactions on Information Theory, 43(5):1740–1747, September 1997. 20
12. T.Siegenthaler. Correlation-immunity of nonlinear combining functions for cryptographic applications. In IEEE Transactions on Information Theory, 30(5):776–780, 1984. 20