# Sequence Design and Construction of Cryptographic Boolean Functions

@inproceedings{Khoo2013SequenceDA, title={Sequence Design and Construction of Cryptographic Boolean Functions}, author={Khoongming Khoo}, year={2013} }

In this thesis, we study the application of well-known sequences from communications theory, in the construction of cryptographic Boolean functions. First, we explain the basic connection between binary sequences, polynomials over the finite field GF (2), and Boolean functions. Second, we classify highly nonlinear quadratic polynomials which may have useful applications in the design and cryptanalysis of finite field based crypto-systems. Third, we construct Boolean functions to be used in… Expand

#### Tables and Topics from this paper

#### One Citation

Boolean Functions with a Few Walsh Transform Values

- Mathematics
- Advances in Artificial Intelligence and Security
- 2021

Boolean functions have been extensively studied in coding theory, cryptography, sequence design and graph theory. By adding two products of three linear functions to some known bent functions, in… Expand

#### References

SHOWING 1-10 OF 101 REFERENCES

New Constructions for Resilient and Highly Nonlinear Boolean Functions

- Computer Science, Mathematics
- ACISP
- 2003

This work constructs highly nonlinear 1-resilient functions which disprove a conjecture of Pasalic and Johansson for n even and gives a new construction for balanced Boolean functions with high nonlinearity, exceeding 2n-1-2( n-1)/2, which is not based on the direct sum construction. Expand

Construction of Nonlinear Boolean Functions with Important Cryptographic Properties

- Mathematics, Computer Science
- EUROCRYPT
- 2000

It is shown that for each positive integer m, there are infinitely many integers n, such that it is possible to construct n-variable, m-resilient functions having nonlinearity greater than 2n-1 -2[n/2]. Expand

Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers

- Mathematics, Computer Science
- CRYPTO
- 2000

This paper investigates the design of S-boxes used for combining linear feedback shift register (LFSR) sequences in combination generators and introduces the notion of maximum correlation, which is based on the correlation between linear functions of the input and all the Boolean functions of an S-box. Expand

Further constructions of resilient Boolean functions with very high nonlinearity

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2002

A design of good combining Boolean functions that provide resilient Boolean functions with currently best known nonlinearity and achieve the provable upper bound on non linearity for resilience Boolean functions. Expand

On Constructions and Nonlinearity of Correlation Immune Functions (Extended Abstract)

- Computer Science, Mathematics
- EUROCRYPT
- 1993

This paper presents a simple method for directly constructing balanced correlation immune functions of any order and proves that this method generates exactly the same set of functions as that obtained using a method by Camion, Carlet, Charpin and Sendrier. Expand

Structures of Cryptographic Functions with Strong Avalanche Characteristics (Extended Abstract)

- Computer Science, Mathematics
- ASIACRYPT
- 1994

The relationship between nonlinearity and propagation characteristic is revealed, two critical indicators of the cryptographic strength of a Boolean function. Expand

On a New Notion of Nonlinearity Relevant to Multi-output Pseudo-random Generators

- Mathematics, Computer Science
- Selected Areas in Cryptography
- 2003

A new lower bound is obtained on the overall maximum correlation to linear functions of vectorial functions which results in an upper bound on the unrestricted nonlinearity. Expand

Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions

- Computer Science
- IMACC
- 1999

This paper establishes the maximum non linearity for a fixed resiliency in certain cases and presents a simple search algorithm for finding Boolean functions with good nonlinearity and some fixed Resiliency. Expand

The Interpolation Attack on Block Ciphers

- Computer Science
- FSE
- 1997

This paper cryptanalyse 5 rounds of a variant of SHARK, which deviates only slightly from the proposed SHark, and shows that there exist ciphers constructed according to this design strategy which can be broken faster than claimed. Expand

Decrypting a Class of Stream Ciphers Using Ciphertext Only

- Computer Science
- IEEE Transactions on Computers
- 1985

The conclusion from the analysis is that the pseudonoise generator's output sequence and the sequences generated by the linear feedback shift registers should be uncorrelated, which leads to constraints for the nonlinear combining function to be used. Expand