New algorithm for exhausting optimal permutations for generalized Feistel networks

DOI10.1007/978-3-031-22912-1_5zbMath1519.94101MaRDI QIDQ6169460

Patrick Derbez, Charles Prud'homme, Stéphanie Delaune, Arthur Gontier

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

block cipherdifferential analysisFeistel network

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• WARP: revisiting GFN for lightweight 128-bit block cipher
• Programming the Demirci-Selçuk meet-in-the-middle attack with constraints
• Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks
• The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
• Piccolo: An Ultra-Lightweight Blockcipher
• On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
• $\textnormal{\textsc{TWINE}}$: A Lightweight Block Cipher for Multiple Platforms
• Improving the Generalized Feistel