On complexity of formal coding method for analysis of generator withmonocycle substitutional transition function | Applied Discrete Mathematics. Supplement. 2009. № 1.

On complexity of formal coding method for analysis of generator withmonocycle substitutional transition function

Download file
Counter downloads: 185

Keywords

Authors

NameOrganizationE-mail
Fomichev V. M.Institute of Informatics Problems of RAS, Moscowfomichev@nm.ru
Всего: 1

References

Фомичёв В. М. Дискретная математика и криптология. М.: ДИАЛОГ-МИФИ, 2003.
Shamir A., Patarin J., Courtois N., and Klimov A. Efficient Algorithms for solving Overdefined Systems of Multivariate Polynomial Equations / / Eurocrypt'2000. Springer. LNCS. 2001. V. 1807.
 On complexity of formal coding method for analysis of generator withmonocycle substitutional transition function | Applied Discrete Mathematics. Supplement. 2009. № 1.

On complexity of formal coding method for analysis of generator withmonocycle substitutional transition function | Applied Discrete Mathematics. Supplement. 2009. № 1.