To cryptanalysis of 2-cascade finite automata cryptographic generators | Applied Discrete Mathematics. Supplement. 2016. № 9.

HomeIssuesTo cryptanalysis of 2-cascade finite automata cryptographic generators | Applied Discrete Mathematics. Supplement. 2016. № 9.

To cryptanalysis of 2-cascade finite automata cryptographic generators

An abstract finite automaton cryptographic generator generalizing the register ($, т)-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.

Download file
Counter downloads: 206

Keywords

finite automaton, cryptographic generator, т)-step generator, cryptanalysis, linearization attack, конечный автомат, криптографический генератор, генератор (5, т)-шагов, криптоанализ, линеаризационная атака

Authors

NameOrganizationE-mail
Agibalov G. P.Tomsk State Universityagibalov@isc.tsu.ru
Pankratova I. A.Tomsk State Universitypank@isc.tsu.ru
Всего: 2

References

To cryptanalysis of 2-cascade finite automata cryptographic generators | Applied Discrete Mathematics. Supplement. 2016. № 9.

To cryptanalysis of 2-cascade finite automata cryptographic generators | Applied Discrete Mathematics. Supplement. 2016. № 9.

Download full-text version
Counter downloads: 1385