A note on some algebraic trapdoors for block ciphers

2017/05/23 by Marco Calderini, Calderini, Marco
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR) #cs.CR #math.GR

paper · pdf · doi:10.48550/arxiv.1705.08151

to be published on Advances in Mathematics of Communications

arxiv created 2018/05/17 · arxiv updated 2018/05/21

Abstract

We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it generalizes that introduced by Paterson in 1999. Moreover, we discuss the fact that studying the group generated by the round functions of a block cipher may not be sufficient to guarantee security against these trapdoors for the cipher.

Related

• Primitivity of the group of a cipher involving the action of the\n key-schedule
• Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis
• Imprimitive permutations groups generated by the round functions of key-alternating block ciphers and truncated differential cryptanalysis
• Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block Cipher
• A possible intrinsic weakness of AES and other cryptosystems