New methods of investigation of perfectly balanced Boolean functions

DOI10.1515/DMA.2009.014zbMath1243.94029OpenAlexW2060900181MaRDI QIDQ3225870

Stanislav V. Smyshlyaev, Oleg A. Logachev, Valerii V. Yashchenko

Publication date: 23 March 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2009.014

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Boolean functions (06E30)

Related Items

On some properties of the curvature and nondegeneracy of Boolean functions ⋮ On 1-stable perfectly balanced Boolean functions ⋮ Perfectly balanced Boolean functions and Golić conjecture ⋮ Enhanced Boolean functions suitable for the filter model of pseudo-random generator ⋮ Boolean functions without prediction ⋮ A criterion of perfect balance for shift-composition of functions over a finite alphabet ⋮ Barriers of perfectly balanced Boolean functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• On nonlinear filter generators
• Revisiting Correlation-Immunity in Filter Generators