ScholarLens Back to search
2009•Unpublished venueRequires access

The Design of Boolean Functions by Modified Hill Climbing Method

Yuriy I. Izbenko, Vladislav Kovtun, Alexandr Alexandrovich Kuznetsov

Open publisher page 53 citations

Abstract

With cryptographic investigations, the design of Boolean functions is a wide area. The Boolean functions play important role in the construction of a symmetric cryptosystem. In this paper the modified hill climbing method is considered. Using hill climbing techniques, the method allows modifying bent functions used to design balanced, highly non-linear Boolean functions with high algebraic degree and low autocorrelation. The experimental results of constructing the cryptographically strong Boolean functions are presented.

About this research paper

What this paper is about

With cryptographic investigations, the design of Boolean functions is a wide area. The Boolean functions play important role in the construction of a symmetric cryptosystem. In this paper the modified hill climbing method is considered. Using hill climbing techniques, the method allows modifying bent functions used to design balanced, highly non-linear Boolean functions with high algebraic degree and low autocorrelation. The experimental results of constructing the cryptographically strong Boolean functions are presented.

Why it matters

OpenAlex reports 53 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

With cryptographic investigations, the design of Boolean functions is a wide area. The Boolean functions play important role in the construction of a symmetric cryptosystem. In this paper the modified hill climbing method is considered. Using hill climbing techniques, the method allows modifying bent functions used to design balanced, highly non-linear Boolean functions with high algebraic degree and low autocorrelation. The experimental results of constructing the cryptographically strong Boolean functions are presented.

Key concepts: Boolean function, Hill climbing, Bent function, Circuit minimization for Boolean functions, Boolean expression, Cryptography, Boolean network, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Design of Boolean Functions by Modified Hill Climbing Method — Research Paper | ScholarLens