Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions

DOI10.1007/978-3-540-77272-9_5zbMath1154.94407OpenAlexW1483474036MaRDI QIDQ5447509

Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis

Publication date: 7 March 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77272-9_5

zbMATH Keywords

Reed-Muller codescovering radiuslow-order approximationsBoolean functionsbent functionssecond-order nonlinearity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Bounds on codes (94B65) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The stability theory of stream ciphers
• On ``bent functions
• Partially-bent functions
• On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
• A new characterization of semi-bent and bent functions on finite fields
• A family of difference sets in non-cyclic groups
• Non-Linear Approximations in Linear Cryptanalysis
• On Bent and Semi-Bent Quadratic Boolean Functions
• New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
• Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
• Recursive Lower Bounds on the Nonlinearity Profile of Boolean Functions and Their Applications
• Cryptanalysis of Achterbahn
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• Low order approximation of cipher functions
• On the weight structure of Reed-Muller codes

This page was built for publication: Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions