Block ciphers based on two feedback shift registers
Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 39-41
Cet article a éte moissonné depuis la source Math-Net.Ru
The conditions of providing bijectivity and involutivity properties are obtained for the block encryption algorithms which are based on a shift register with two feedbacks over the space of binary vectors. An example of a block encryption algorithm of this kind is constructed. The algorithm is based on a shift register of length 4.
Keywords:
bijectivity, iterative symmetric block ciphers, involutivity of encryption algorithm, shift registers.
@article{PDMA_2013_6_a19,
author = {A. M. Koreneva},
title = {Block ciphers based on two feedback shift registers},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {39--41},
year = {2013},
number = {6},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a19/}
}
A. M. Koreneva. Block ciphers based on two feedback shift registers. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 39-41. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a19/
[1] Koreneva A. M., Fomichev V. M., “Ob odnom obobschenii blochnykh shifrov Feistelya”, Prikladnaya diskretnaya matematika, 2012, no. 3, 34–40 | MR
[2] Koreneva A. M., Fomichev V. M., “Kriptograficheskie svoistva blochnykh shifrov, postroennykh na osnove registrov sdviga”, Prikladnaya diskretnaya matematika. Prilozhenie, 2012, no. 5, 49–51 | MR