About Feistel Schemes with Six (or More) Rounds

DOI10.1007/3-540-69710-1_8zbMath1385.94064OpenAlexW1491523234MaRDI QIDQ4639444

Jacques Patarin

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/3-540-69710-1_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

The key-dependent message security of key-alternating Feistel ciphers ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers ⋮ On Lai-Massey and quasi-Feistel ciphers ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier ⋮ Generic attacks on the Lai-Massey scheme ⋮ Luby-Rackoff revisited: on the use of permutations as inner functions of a Feistel scheme ⋮ Multilane HMAC— Security beyond the Birthday Limit ⋮ Building Secure Block Ciphers on Generic Attacks Assumptions

Cites Work

• Local randomness in pseudorandom sequences
• Foiling Birthday Attacks in Length-Doubling Transformations
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About Feistel Schemes with Six (or More) Rounds