Evolving Boolean functions satisfying multiple criteria

J A Clark; J L Jacob; S Stepney; S Maitra; W Millan

doi:10.1007/3-540-36231-2_20

Evolving Boolean functions satisfying multiple criteria

J A Clark, J L Jacob, S Stepney, S Maitra, W Millan

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Many desirable properties have been identified for Boolean functions with cryptographic applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we show how simulated annealing, a search technique inspired by the cooling processes of molten metals, can be used to derive functions with profiles of cryptographically-relevant properties as yet unachieved by any other technique.

Original language	English
Title of host publication	PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS
Editors	A Menezes, P Sarkar
Place of Publication	BERLIN
Publisher	Springer
Pages	246-259
Number of pages	14
ISBN (Print)	3-540-00263-4
DOIs	https://doi.org/10.1007/3-540-36231-2_20
Publication status	Published - 2002
Event	Third International Conference on Cryptology in India - Hyderabad, India Duration: 16 Dec 2002 → 18 Dec 2002

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2551

Conference

Conference	Third International Conference on Cryptology in India
Country/Territory	India
City	Hyderabad
Period	16/12/02 → 18/12/02

Keywords

heuristic optimisation
Boolean functions
nonlinearity
autocorrelation
correlation immunity
CRYPTOGRAPHIC APPLICATIONS
COVERING RADIUS
CONSTRUCTIONS
NONLINEARITY
DESIGN

Access to Document

10.1007/3-540-36231-2_20

http://dx.doi.org/10.1007/3-540-36231-2_20

Cite this

@inproceedings{5d8951aebbc04da7922a663cefc9c8bf,

title = "Evolving Boolean functions satisfying multiple criteria",

abstract = "Many desirable properties have been identified for Boolean functions with cryptographic applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we show how simulated annealing, a search technique inspired by the cooling processes of molten metals, can be used to derive functions with profiles of cryptographically-relevant properties as yet unachieved by any other technique.",

keywords = "heuristic optimisation, Boolean functions, nonlinearity, autocorrelation, correlation immunity, CRYPTOGRAPHIC APPLICATIONS, COVERING RADIUS, CONSTRUCTIONS, NONLINEARITY, DESIGN",

author = "Clark, {J A} and Jacob, {J L} and S Stepney and S Maitra and W Millan",

year = "2002",

doi = "10.1007/3-540-36231-2_20",

language = "English",

isbn = "3-540-00263-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "246--259",

editor = "A Menezes and P Sarkar",

booktitle = "PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS",

address = "Germany",

note = "Third International Conference on Cryptology in India ; Conference date: 16-12-2002 Through 18-12-2002",

}

Clark, JA , Jacob, JL , Stepney, S, Maitra, S & Millan, W 2002, Evolving Boolean functions satisfying multiple criteria. in A Menezes & P Sarkar (eds), PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS. Lecture Notes in Computer Science, vol. 2551, Springer, BERLIN, pp. 246-259, Third International Conference on Cryptology in India, Hyderabad, India, 16/12/02. https://doi.org/10.1007/3-540-36231-2_20

TY - GEN

T1 - Evolving Boolean functions satisfying multiple criteria

AU - Clark, J A

AU - Jacob, J L

AU - Stepney, S

AU - Maitra, S

AU - Millan, W

PY - 2002

Y1 - 2002

N2 - Many desirable properties have been identified for Boolean functions with cryptographic applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we show how simulated annealing, a search technique inspired by the cooling processes of molten metals, can be used to derive functions with profiles of cryptographically-relevant properties as yet unachieved by any other technique.

AB - Many desirable properties have been identified for Boolean functions with cryptographic applications. Obtaining optimal tradeoffs among such properties is hard. In this paper we show how simulated annealing, a search technique inspired by the cooling processes of molten metals, can be used to derive functions with profiles of cryptographically-relevant properties as yet unachieved by any other technique.

KW - heuristic optimisation

KW - Boolean functions

KW - nonlinearity

KW - autocorrelation

KW - correlation immunity

KW - CRYPTOGRAPHIC APPLICATIONS

KW - COVERING RADIUS

KW - CONSTRUCTIONS

KW - NONLINEARITY

KW - DESIGN

U2 - 10.1007/3-540-36231-2_20

DO - 10.1007/3-540-36231-2_20

M3 - Conference contribution

SN - 3-540-00263-4

T3 - Lecture Notes in Computer Science

SP - 246

EP - 259

BT - PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS

A2 - Menezes, A

A2 - Sarkar, P

PB - Springer

CY - BERLIN

T2 - Third International Conference on Cryptology in India

Y2 - 16 December 2002 through 18 December 2002

ER -