Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme

DOI10.1007/s10623-005-3562-2zbMath1144.94383OpenAlexW2003251398MaRDI QIDQ2491299

Gilles Piret

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-3562-2

zbMATH Keywords

block cipherspseudorandomnesssymmetric cryptographyFeistel schemeLuby-Rackoff-modelsuper-pseudorandomness

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Beyond-birthday security for permutation-based Feistel networks ⋮ On Lai-Massey and quasi-Feistel ciphers ⋮ Square reflection cryptanalysis of 5-round Feistel networks with permutations ⋮ Generic Attacks on Feistel Networks with Internal Permutations ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions

Uses Software

• Camellia
• Twofish

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• On weaknesses of non-surjective round functions
• Provable security against a differential attack
• Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
• New Results on the Pseudorandomness of Some Blockcipher Constructions
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Cryptanalysis of Ladder-DES
• About Feistel Schemes with Six (or More) Rounds
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme