Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes

DOI10.1007/978-3-540-77272-9_7MaRDI QIDQ5447511zbMATH OpenOpenAlexFDO

Authors Juan M. E. Tapiador, John A. Clark, Julio Cesar Hernandez-Castro

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_7

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Non-linear approximations in linear cryptanalysis
• The designs of S-boxes by simulated annealing
• Generalized nonlinearity of S-boxes
• Low order approximation of cipher functions
• Evolutionary heuristics for finding cryptographically strong S-boxes

Cites work

• A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
• DES has no per round linear factors
• Fast Software Encryption
• Heuristic design of cryptographically strong balanced Boolean functions
• How to improve the nonlinearity of bijective S-boxes.
• scientific article; zbMATH DE number 1612515 (Why is no real title available?)
• scientific article; zbMATH DE number 3952651 (Why is no real title available?)
• scientific article; zbMATH DE number 4079313 (Why is no real title available?)
• scientific article; zbMATH DE number 697799 (Why is no real title available?)
• scientific article; zbMATH DE number 1759278 (Why is no real title available?)
• Linear cryptanalysis method for DES cipher
• Linear cryptanalysis using multiple approximations
• Non-linear approximations in linear cryptanalysis
• On correlation between the order of S-boxes and the strength of DES
• Optimization by simulated annealing
• The first experimental cryptanalysis of the Data Encryption Standard

Cited in

(2)

• Linear Cryptanalysis of Reduced-Round Speck with a Heuristic Approach: Automatic Search for Linear Trails
• On quadratic approximations in block ciphers

This page was built for publication: Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447511)