Random permutation statistics and an improved slide-determine attack on KeeLoq

DOI10.1007/978-3-642-28368-0_6zbMATH Open1285.94052OpenAlexW1504105902MaRDI QIDQ2889751FDOQ2889751

Authors Nicolas Courtois, Gregory V. Bard 

Publication date 8 June 2012

Published in Cryptography and Security: From Theory to Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28368-0_6

zbMATH Keywords

block ciphersslide attacksautomobile lockshighly-unbalanced compressing Feistel ciphersKeeLoqrandom permutation statistics

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Periodic ciphers with small blocks and cryptanalysis of Keeloq
• Algebraic and Slide Attacks on KeeLoq
• Linear Slide Attacks on the KeeLoq Block Cipher
• A Practical Attack on KeeLoq
• Self-similarity attacks on block ciphers and application to KeeLoq

Cited in

(9)

• Reflections on slide with a twist attacks
• Can a differential attack work for an arbitrarily large number of rounds?
• Meet-in-the-middle cube attack on reduced version of KeeLoq
• A practical attack on KeeLoq
• Self-similarity attacks on block ciphers and application to KeeLoq
• Linear Slide Attacks on the KeeLoq Block Cipher
• Periodic ciphers with small blocks and cryptanalysis of Keeloq
• A Practical Attack on KeeLoq
• Algebraic and Slide Attacks on KeeLoq

This page was built for publication: Random permutation statistics and an improved slide-determine attack on KeeLoq

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