Cryptanalysis of Ladder-DES

DOI10.1007/BFB0052341MaRDI QIDQ4639335zbMATH OpenOpenAlexFDO

Authors Eli Biham

Publication date 9 May 2018

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

Full work available at URL https://doi.org/10.1007/bfb0052341

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The security of Feistel ciphers with six rounds or less
• Advances in Cryptology – CRYPTO 2004
• Feistel ciphers. Security proofs and cryptanalysis
• scientific article; zbMATH DE number 1617918
• Luby-Rackoff Ciphers from Weak Round Functions?

Cites work

• Fast Data Encipherment Algorithm FEAL
• Faster Luby-Rackoff ciphers
• Foiling birthday attacks in length-doubling transformations
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• scientific article; zbMATH DE number 54248 (Why is no real title available?)
• Two practical and provably secure block ciphers: BEAR and LION

Cited in

(6)

• On weaknesses of non-surjective round functions
• Cryptanalysis of LEDAcrypt
• Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme
• Feistel ciphers. Security proofs and cryptanalysis
• Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
• Generic Attacks on Feistel Networks with Internal Permutations

This page was built for publication: Cryptanalysis of Ladder-DES

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