|
This article is cited in 3 scientific papers (total in 3 papers)
Mathematical Methods of Cryptography
To cryptanalysis of $2$-cascade finite automata cryptographic generators
G. P. Agibalov, I. A. Pankratova Tomsk State University, Tomsk
Abstract:
An abstract finite automaton cryptographic generator generalizing the register $(\delta,\tau)$-step generator is defined. Some attacks on it with the object to determine initial states or (and) output functions of its automata are presented. The complexity of these attacks are much less than the complexity of the brute-force attack.
Keywords:
finite automaton, cryptographic generator, $(\delta, \tau)$-step generator, cryptanalysis, linearization attack.
Citation:
G. P. Agibalov, I. A. Pankratova, “To cryptanalysis of $2$-cascade finite automata cryptographic generators”, Prikl. Diskr. Mat. Suppl., 2016, no. 9, 41–43
Linking options:
https://www.mathnet.ru/eng/pdma256 https://www.mathnet.ru/eng/pdma/y2016/i9/p41
|
Statistics & downloads: |
Abstract page: | 173 | Full-text PDF : | 66 | References: | 35 |
|