Boolean function design using hill climbing methods

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

Volumn 1587, Issue , 1999, Pages 1-11

  Millan, William ^a   Clark, Andrew ^a   Dawson, Ed ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOCORRELATION; CRYPTOGRAPHY; HADAMARD TRANSFORMS; HEURISTIC METHODS; ITERATIVE METHODS; SECURITY OF DATA;

AUTOCORRELATION FUNCTIONS; CRYPTOGRAPHIC CRITERION; CRYPTOGRAPHIC PROPERTIES; GENERATED FUNCTION; HILL CLIMBING; HILL-CLIMBING METHODS; INCREMENTAL IMPROVEMENTS; WALSH HADAMARD TRANSFORMS;

BOOLEAN FUNCTIONS;

EID: 84961378133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48970-3_1     Document Type: Conference Paper

References (9)

1. E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. In Advances in Cryptology - Crypto’90, Proceedings, volume 537 of Lecture Notes in Computer Science, pages 2-21. Springer-Verlag, 1991.
2. C. Carlet. Partially-Bent Functions. In Advances in Cryptology - Crypto’92, Proceedings, volume 740 of Lecture Notes in Computer Science, pages 280-291. Springer- Verlag, 1993.
3. M. Matsui. Linear Cryptanalysis Method for DES Cipher. In Advances in Cryptology - Eurocrypt ’93, Proceedings, volume 765, pages 386-397. Springer-Verlag, 1994.
4. W. Meier and O. Staffelbach. Nonlinearity Criteria for Cryptographic Functions. In Advances in Cryptology - Eurocrypt ’89, Proceedings, volume 434, pages 549-562. Springer-Verlag, 1990.
5. W. Millan, A. Clark, and E. Dawson. An Effective Genetic Algorithm for Finding Highly Nonlinear Boolean Functions. In First International Conference on Information and Communications Security, ICICS’97, volume 1334 of Lecture Notes in Computer Science, pages 149-158. Springer-Verlag, 1997.
6. W. Millan, A. Clark, and E. Dawson. Smart Hill Climbing Finds Better Boolean Functions. In Workshop on Selected Areas in Cryptology 1997, Workshop Record, pages 50-63, 1997.
7. W. Millan, A. Clark, and E. Dawson. Heuristic Design of Cryptographically Strong Balanced Boolean Functions. In Advances in Cryptology - Eurocrypt’98, Proceedings, volume 1403 of Lecture Notes in Computer Science, pages 489-499. Springer- Verlag, 1998.
8. O.S. Rothaus. On Bent Functions. Journal of Combinatorial Theory (A), 20:300-305, 1976.
9. X.-M. Zhang and Y. Zheng. Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions. In Advances in Cryptology - Eurocrypt’96, Proceedings, volume 1070 of Lecture Notes in Computer Science, pages 294-306. Springer-Verlag, 1996.