To obtain access to full text of journal and articles you must register!
- Article name
- Principles of optimization of digraph exponent and local exponent bounds
- Authors
- Kyazhin S. N., , s.kyazhin@kaf42.ru, National Research Nuclear University MEPhI, Moscow, Russia
- Keywords
- matrix-graph approach / exponent / local exponent / lattice / set of natural numbers
- Year
- 2017 Issue 1 Pages 22 - 26
- Code EDN
- Code DOI
- Abstract
- The exponent and local exponent of mixing digraph of functions used in cryptographic systems are estimated for the implementation of matrix-graph approach to the study of the functions mixing properties. The values of existing bounds are determined by the characteristics of the digraph cycle set. Therefore to obtain the optimum bound it needs to choice the cycle set with specific properties. Using the structure of the local primitive digraphs and the properties of the digraph cycle set the principles of optimization of digraph exponent and local exponent bounds are formulated.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
