Random Permutation Statistics and an Improved Slide-Determine Attack on KeeLoq

DOI10.1007/978-3-642-28368-0_6zbMath1285.94052OpenAlexW1504105902MaRDI QIDQ2889751

Gregory V. Bard, Nicolas T. Courtois

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

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

Related Items (2)

Can a differential attack work for an arbitrarily large number of rounds? ⋮ Reflections on slide with a twist attacks

This page was built for publication: Random Permutation Statistics and an Improved Slide-Determine Attack on KeeLoq