The piling-up approximation in linear cryptanalysis

DOI10.1109/18.959262MaRDI QIDQ4544725zbMATH OpenOpenAlexFDO

Authors Zsolt Kukorelly

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.959262

zbMATH Keywords

block cipherlinear cryptanalysispiling-up lemma

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Cryptography (94A60)

Recommendations

• A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma
• On linear cryptanalysis with many linear approximations
• Linear cryptanalysis using multiple approximations
• Linear cryptanalysis using multiple linear approximations
• Non-linear approximations in linear cryptanalysis
• Linear cryptanalysis using multiple approximations and FEAL
• The Independence of Linear Approximations in Symmetric Cryptanalysis
• scientific article; zbMATH DE number 4187707
• On Large Distributions for Linear Cryptanalysis

Cited in

(2)

• Problems with the linear cryptanalysis of DES using more than one active S-box per round
• The piling-up lemma and dependent random variables

This page was built for publication: The piling-up approximation in linear cryptanalysis

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