2004•Computational IntelligenceRequires access

Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion

John A. Clark, Jeremy Jacob, Subhamoy Maitra, Pantelimon Stănică

Abstract

The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is “Boolean‐ness” that is evolved.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 64 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Boolean function, Standard Boolean model, Parity function, Boolean expression, And-inverter graph, Boolean circuit, Mathematics, Boolean network