Some group-theoretical results on Feistel networks in a long-key scenario

DOI10.3934/amc.2020093zbMath1451.94027arXiv1912.06751OpenAlexW3039790966MaRDI QIDQ2210647

Marco Calderini, Riccardo Aragona, Roberto Civino

Publication date: 7 November 2020

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.06751

zbMATH Keywords

partitionsblock ciphersymmetric cryptographytrapdoorgroup generated by round functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On the primitivity of the AES-128 key-schedule ⋮ On invariant subspaces in the Lai-Massey scheme and a primitivity reduction

Uses Software

• PRESENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The group generated by the round functions of a GOST-like cipher
• An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
• Differential cryptanalysis of DES-like cryptosystems
• On some block ciphers and imprimitive groups
• Group theoretic properties of Rijndael-like ciphers
• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Wave-shaped round functions and primitive groups
• A note on some algebraic trapdoors for block ciphers
• On the group generated by the round functions of translation based ciphers over arbitrary finite fields
• The Round Functions of RIJNDAEL Generate the Alternating Group
• PRESENT: An Ultra-Lightweight Block Cipher
• Communication Theory of Secrecy Systems*
• Generators for Certain Alternating Groups with Applications to Cryptography
• Primitivity of PRESENT and other lightweight ciphers
• Partitioning cryptanalysis