The piling-up lemma and dependent random variables

DOI10.1007/3-540-46665-7_22MaRDI QIDQ4945367zbMATH OpenFDO

Authors Zsolt Kukorelly

Publication date 18 March 2002

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

Full work available at URL https://doi.org/10.1007/3-540-46665-7_22

zbMATH Keywords

dependent random variablesindependent, binary-valued random variableslinear cryptoanalysis attackpiling-up approximationpiling-up lemma

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The piling-up approximation in linear cryptanalysis
• On bias estimation in linear cryptoanalysis
• scientific article; zbMATH DE number 5946288
• A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma
• Problems with the linear cryptanalysis of DES using more than one active S-box per round

Cited in

(3)

• Walsh transforms and cryptographic applications in bias computing
• scientific article; zbMATH DE number 5946288 (Why is no real title available?)
• Observing biases in the state: case studies with Trivium and Trivia-SC

This page was built for publication: The piling-up lemma and dependent random variables

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