Properties of linear approximation tables

DOI10.1007/3-540-60590-8_10MaRDI QIDQ4484893zbMATH OpenFDO

Authors Luke O'Connor

Publication date 5 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60590-8_10

zbMATH Keywords

Feistel cipherslinear approximation tableslinear cryptanalysisnonlinear mappings

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Linear approximation of block ciphers
• On linear cryptanalysis with many linear approximations
• Linear cryptanalysis using multiple approximations
• Non-linear approximations in linear cryptanalysis

Cited in

(7)

• Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis
• Linear hulls with correlation zero and linear cryptanalysis of block ciphers
• Probability distributions of correlation and differentials in block ciphers
• Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction
• Another look at key randomisation hypotheses
• On nonsingular weightwise perfectly balanced functions
• On a heuristic approach to constructing bijective vector Boolean functions with given cryptographic properties

This page was built for publication: Properties of linear approximation tables

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