Geodesic
On weak key-scheduling algorithms relatively the related-key attack
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 27-29

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper key-scheduling algorithms having the defined recurrent property are considered. For this class of algorithms we describe related-key attacks. The complexity of the attack is equal to the exhaustive search of one round key. It requires a little number of plaintexts. 
@article{PDM_2010_12_a11,
     author = {M. A. Pudovkina},
     title = {On weak key-scheduling algorithms relatively the related-key attack},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {27--29},
     publisher = {mathdoc},
     number = {12},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a11/}
}
TY  - JOUR
AU  - M. A. Pudovkina
TI  - On weak key-scheduling algorithms relatively the related-key attack
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 27
EP  - 29
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a11/
LA  - ru
ID  - PDM_2010_12_a11
ER  - 
%0 Journal Article
%A M. A. Pudovkina
%T On weak key-scheduling algorithms relatively the related-key attack
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 27-29
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a11/
%G ru
%F PDM_2010_12_a11
M. A. Pudovkina. On weak key-scheduling algorithms relatively the related-key attack. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 27-29. http://geodesic.mathdoc.fr/item/PDM_2010_12_a11/