Searching for cost functions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Boolean function design is at the heart of cryptography, and is the subject of a great deal of theoretical research. We have use a simulated annealing approach to find functions with particular desirable cryptographic properties; for functions of a small number of variables, results with properties as good as (and sometimes better than) the best so far have been achieved. The success of this approach is very sensitive to the cost function chosen; here we investigate this property, and describe a meta-search approach to finding the most effective cost function for this class of problems.

Original languageEnglish
Title of host publicationCEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2
Place of PublicationNEW YORK
PublisherIEEE
Pages1517-1524
Number of pages8
ISBN (Print)0-7803-8515-2
Publication statusPublished - 2004
EventCongress on Evolutionary Computation (CEC 2004) - Portland
Duration: 19 Jun 200423 Jun 2004

Conference

ConferenceCongress on Evolutionary Computation (CEC 2004)
CityPortland
Period19/06/0423/06/04

Keywords

  • BALANCED BOOLEAN FUNCTIONS
  • GLOBAL AVALANCHE CHARACTERISTICS

Cite this