Searching for cost functions

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 2, Issue , 2004, Pages 1517-1524

  Clark, John A ^a   Jacob, Jeremy L ^a   Stepney, Susan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOCORRELATION; CORRELATION IMMUNITY; COST FUNCTIONS; PARSEVAL'S EQUATION;

ALGORITHMS; BOOLEAN FUNCTIONS; CORRELATION METHODS; COST EFFECTIVENESS; CRYPTOGRAPHY; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; SIMULATED ANNEALING; VECTORS;

COMPUTER SCIENCE;

EID: 4344581166     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. C. Carlet. On the coset weight divisibility and nonlinearity of resilient and correlation-immune functions. In SETA 2001, 2001.
2. J. A. Clark and J. L. Jacob. Two stage optimisation in the design of Boolean functions. In E. Dawson, A. Clark, and C. Boyd, editors, 5th Australasian Conference on Information Security and Privacy, ACISP 2000, pages 242-254. LNCS 1841. Springer, 2000.
3. John A. Clark, Jeremy L. Jacob, and Susan Stepney. The Design of S-Boxes by Simulated Annealing. In CEC 2004: International Conference on Evolutionary Computation, Portland, USA, June 2004, 2004. (these proceedings).
4. J. A. Clark, J. L. Jacob, and S. Stepney. Secret agents leave big footprints: how to plant a cryptographic trapdoor, and why you might not get away with it. In Genetic and Evolutionary Computation Conference: GECCO 2003, pages 2022-2033. LNCS 2724. Springer, 2003.
5. J. A. Clark, J. L. Jacob, S. Stepney, S. Maitra, and W. Millan. Evolving boolean functions satisfying multiple criteria. In Progress in Cryptology: Indocrypt 2002, volume 2551 of LNCS, pages 246-259. Springer, 2002.
6. H. Dobbertin. Construction of bent functions and balanced functions with high nonlinearity. In Fast Software Encryption, 1994 Leuven Workshop, pages 61-74. LNCS 1008. Springer, 1994.
7. X.-D. Hou. On the norm and covering radius of first-order Reed-Muller codes. IEEE Trans. Inform. Theory, 43(3):1025-1027, May 1997.
8. 15,16) Reed-Muller code is at least 16276. IEEE Trans. Inform. Theory, 43(3):1025-1027, May 1997.
9. S. Maitra. Highly nonlinear balanced Boolean functions with very good autocorrelation property. Technical Report 2000/047, Indian Statistical Institute, Calcutta, 2000. http://eprint.iacr.org/.
10. S. Maitra. Autocorrelation properties of correlation immune Boolean functions. In Indocrypt'01, pages 242-253. Springer, 2001.
11. S. Maitra and E. Pasalic. Further constructions of resilient Boolean functions with very high nonlinearity. In Proc. SETA' 01, 2001.
12. W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology: EuroCrypt '89, pages 549-562. LNCS 434. Springer, 1989.
13. W. Millan, A. Clark, and E. Dawson. Heuristic design of cryptographically strong balanced Boolean functions. In Advances in Cryptology EUROCRYPT'98, pages 489-499. LNCS 1403. Springer, 1998.
14. E. Pasalic, S. Maitra, T. Johansson, and P. Sarkar. New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity. In Workshop on Coding Theory, Electronic Notes in Discrete Mathematics. Elsevier, 2001.
15. O.S. Rothaus. On bent functions. Journal of Combinatorial Theory: Series A, 20:300-305, 1976.
16. J. J. Son, J. I. Lim, S. Chee, and S. H. Sung. Global Avalanche Characteristics and nonlinearity of balanced Boolean functions. Information Processing Letters, 65(3):139-144, 1998.
17. S. H. Sung, S. Chee, and C. Park. Global Avalanche Characteristics and propagation criterion of balanced Boolean functions. Information Processing Letters, 69(1):21-24, 1999.
18. Y. Tarannikov. On resilient Boolean functions with maximal possible nonlinearity. Technical Report 2000/005, Mech. and Math. Department, Moscow State University, 2000. http://eprint.iacr.org/.
19. X-M. Zhang and Y. Zheng. GAC - the criterion for Global Avalanche Characteristics of cryptographic functions. Journal of Universal Computer Science, 1(5):316-333, 1995.