Primitivity and Local Primitivity of Digraphs and Nonnegative Matrices


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

The article surveys the main results on the primitivity and local primitivity of digraphs and matrices from the inception of this research area in 1912 by now. We review the universal and special criteria for primitivity and local primitivity as well as universal and special bounds on the exponents and local exponents of digraphs and matrices. We describe some cryptographic applications of this mathematical apparatus for analyzing the mixing properties of block ciphers and keystream generators. The new promising research directions are formulated in the study of primitivity and local primitivity of digraphs and matrices.

作者简介

V. Fomichev

Financial University under the Government of the Russian Federation; National Research Nuclear University MEPhI; Institute of Informatics Problems

编辑信件的主要联系方式.
Email: fomichev@nm.ru
俄罗斯联邦, Leningradskii pr. 49, Moscow, 125993; Kashirskoe sh. 31, Moscow, 115409; ul. Vavilova 44, korp. 2, Moscow, 119333

Ya. Avezova

National Research Nuclear University MEPhI

Email: fomichev@nm.ru
俄罗斯联邦, Kashirskoe sh. 31, Moscow, 115409

A. Koreneva

National Research Nuclear University MEPhI

Email: fomichev@nm.ru
俄罗斯联邦, Kashirskoe sh. 31, Moscow, 115409

S. Kyazhin

National Research Nuclear University MEPhI

Email: fomichev@nm.ru
俄罗斯联邦, Kashirskoe sh. 31, Moscow, 115409

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2018