On weak rotors, Latin squares, linear algebraic representations, invariant differentials and cryptanalysis of Enigma

DOI10.21857/y26kec4k89zbMath1482.94047OpenAlexW3197671927MaRDI QIDQ5025954

No author found.

Publication date: 7 February 2022

Published in: Sv. 25(2021)=knj. 60 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21857/y26kec4k89

zbMATH Keywords

Latin squaresblock ciphersquasigroupsalgebraic representationdifferential cryptanalysislinear cryptanalysisweak keysenigmaTuring-Welchman attack

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15) Actions of groups on commutative rings; invariant theory (13A50) Loops, quasigroups (20N05)

Cites Work

• Can a differential attack work for an arbitrarily large number of rounds?
• A note on some algebraic trapdoors for block ciphers
• The MALICIOUS framework: embedding backdoors into tweakable block ciphers
• Malicious Hashing: Eve’s Variant of SHA-1
• Spanish Enigma: A History of the Enigma in Spain
• Wilhelm Fenner and the Development of the German Cipher Bureau, 1922–1939
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• CIPHERTEXT-ONLY CRYPTANALYSIS OF ENIGMA
• Advances in Cryptology – CRYPTO 2004
• Advanced Encryption Standard – AES
• Algebraic Cryptanalysis of the Data Encryption Standard
• Unnamed Item
• Unnamed Item

This page was built for publication: On weak rotors, Latin squares, linear algebraic representations, invariant differentials and cryptanalysis of Enigma