On the nonlinearity of S-boxes and linear codes

DOI10.1007/s12095-015-0176-zzbMath1357.94071OpenAlexW2233065590MaRDI QIDQ507951

Sihem Mesnager, Lusheng Chen, Jian Liu

Publication date: 9 February 2017

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

Full work available at URL: https://doi.org/10.1007/s12095-015-0176-z

zbMATH Keywords

nonlinearitylinear codesS-boxessymmetric cryptographyaffine approximation attackmulti-output Boolean functions

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (4)

Characteristics of nonlinearity of vectorial functions over finite fields ⋮ Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators ⋮ The replacement of irreducible polynomial and affine mapping for the construction of a strong S-box ⋮ Linear codes from vectorial Boolean functions in the context of algebraic attacks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinearities of S-boxes
• The stability theory of stream ciphers
• Highly nonlinear mappings
• Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Perfect nonlinear S-boxes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• Selected Areas in Cryptography

This page was built for publication: On the nonlinearity of S-boxes and linear codes