Heuristic design of cryptographically strong balanced Boolean functions
- 1 January 1998
- book chapter
- Published by Springer Science and Business Media LLC
- p. 489-499
- https://doi.org/10.1007/bfb0054148
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Nonlinearly Balanced Boolean Functions and Their Propagation CharacteristicsPublished by Springer Science and Business Media LLC ,2001
- Partially-bent functionsPublished by Springer Science and Business Media LLC ,2001
- On the norm and covering radius of the first-order Reed-Muller codesIEEE Transactions on Information Theory, 1997
- A PARALLEL GENETIC ALGORITHM FOR CRYPTANALYSIS OF THE POLYALPHABETIC SUBSTITUTION CIPHERCryptologia, 1997
- An effective genetic algorithm for finding highly nonlinear boolean functionsLecture Notes in Computer Science, 1997
- COMBINATORIAL OPTIMIZATION AND THE KNAPSACK CIPHERCryptologia, 1996
- Linear Cryptanalysis Method for DES CipherLecture Notes in Computer Science, 1994
- THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSISCryptologia, 1993
- Propagation Characteristics of Boolean FunctionsLecture Notes in Computer Science, 1991
- The covering radius of the(2^{15}, 16)Reed-Muller code is at least 16276IEEE Transactions on Information Theory, 1983