|
On group properties of classes Source-Heavy and Target-Heavy Feistel block ciphers with round functions linear dependent on round keys parts
B. A. Pogorelova, M. A. Pudovkinab a Academy of Cryptography of the Russian Federation, Moscow
b National Research Nuclear University (MEPhI)
Abstract:
Source-Heavy and Target-Heavy block ciphers, which are based on a shift register of length m⩾3 over GF(2n), are generalized Feistel schemes. Well-known examples of these ciphers are RC2, MARS. In this paper, we study Source-Heavy and Target-Heavy block ciphers such that round functions over a finite abelian group X depend linearly on parts of round keys. We describe conditions on round functions such that a group G generated by round functions is embedded in an exponentiation subgroup. Under these conditions, we get metrics saved by the encryption function for all round keys and G.
Key words:
generalized Feistel scheme (GFS), uniprimitive group, primitive group, O’Nan–Scott theorem, orbital metric of permutation group, Source-Heavy (SH) GFS, Target-Heavy (TH) GFS.
Received 07.X.2022
Citation:
B. A. Pogorelov, M. A. Pudovkina, “On group properties of classes Source-Heavy and Target-Heavy Feistel block ciphers with round functions linear dependent on round keys parts”, Mat. Vopr. Kriptogr., 14:3 (2023), 127–155
Linking options:
https://www.mathnet.ru/eng/mvk451https://doi.org/10.4213/mvk451 https://www.mathnet.ru/eng/mvk/v14/i3/p127
|
Statistics & downloads: |
Abstract page: | 153 | Full-text PDF : | 39 | References: | 34 | First page: | 4 |
|