Linear distinguishers in the key-less setting: application to PRESENT

DOI10.1007/978-3-662-48116-5_11MaRDI QIDQ2946944zbMATH OpenOpenAlexFDO

Authors Martin M. Lauridsen, Christian Rechberger

Publication date 18 September 2015

Published in Fast Software Encryption (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48116-5_11

zbMATH Keywords

hash functionblock cipherlinear cryptanalysisdistinguisherPRESENT

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Known-key distinguisher on full \(\mathtt{PRESENT}\)
• Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT
• Linear cryptanalysis of reduced-round PRESENT
• Weak keys of reduced-round PRESENT for linear cryptanalysis
• Improving key-recovery in linear attacks: application to 28-round PRESENT

Cited in

(5)

• Optimising linear key recovery attacks with affine Walsh transform pruning
• Known-key distinguisher on full \(\mathtt{PRESENT}\)
• Estimating the probabilities of low-weight differential and linear approximations on PRESENT-like ciphers
• Truncated differential based known-key attacks on round-reduced SIMON
• Weak keys of reduced-round PRESENT for linear cryptanalysis

This page was built for publication: Linear distinguishers in the key-less setting: application to PRESENT

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