A new construction of highly nonlinear S-boxes

DOI10.1007/s12095-011-0052-4zbMath1277.94013OpenAlexW2076872242MaRDI QIDQ662201

Gregor Leander, Beelen, Peter

Publication date: 21 February 2012

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-011-0052-4

zbMATH Keywords

Reed-Muller codesnonlinearitylinear codesconcatenationvectorial Boolean functions

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Bounds on codes (94B65) Numerical methods for discrete and fast Fourier transforms (65T50) Boolean functions (06E30)

Related Items (3)

On the algebraic immunity of multiplexer Boolean functions ⋮ Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators ⋮ О разностных свойствах симметричного криптоалгоритма, основанного на псевдодинамических подстановках

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinearities of S-boxes
• New families of quadratic almost perfect nonlinear trinomials and multinomials
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• The Magma algebra system. I: The user language
• Perfect nonlinear S-boxes
• Upper and lower bounds on maximum nonlinearity of \(n\)-input \(m\)-output Boolean function

This page was built for publication: A new construction of highly nonlinear S-boxes