On the Complexity of Specifying a Symmetric Group of Permutations of Degree 2n in a Threshold Basis on a Promising Element Base
( Pp. 50-58)

More about authors
Zobov Anton I. research employee of Foundation for the Promotion of Secure Information Technologies. Moscow, Russian Federation. E-mail: zobowai@gmail.com
Foundation for the Promotion of Secure Information Technologies
Moscow, Russian Federation Nikonov Nikolay V. kandidat fiziko-matematicheskih nauk, docent; ekspert
Technical Committee for Standardization TC26
Moscow, Russian Federation Nikonov Vladimir G. Doctor of Engineering, Professor; member at the Presidium
Russian Academy of Natural Sciences
Moscow, Russian Federation
Abstract:
The appeal to the threshold method of setting substitutions reflects the current trends towards increasing the speed of information processing and transmission connected with the possibility of implementing threshold functions directly in the signal carrier medium, primarily in optics or on other carriers related to the field of nanotechnology. In addition, the actively developing direction of building neurocomputers also requires the development of information protection systems using the basic operations of neurocomputers-threshold elements. The aim of the study was to find a way to construct a symmetric group of substitutions of degree 2n in the threshold basis. For this purpose, a method for implementing transpositions is proposed, with the help of which any transposition can be constructed, which allows us to say that it is possible to implement the entire symmetric group of substitutions of degree 2n. From a computational point of view, the provisions of the article are of exceptional interest due to the simplicity of the algorithm for implementing substitutions.
How to Cite:
Zobov A.I., Nikonov N.V., Nikonov V.G., (2021), ON THE COMPLEXITY OF SPECIFYING A SYMMETRIC GROUP OF PERMUTATIONS OF DEGREE 2N IN A THRESHOLD BASIS ON A PROMISING ELEMENT BASE. Computational Nanotechnology, 3 => 50-58.
Reference list:
Huffman D.A. Canonical forms for information lossless finite-state logical machines // IRE Trans. Circ. Theory. 1959. No. 6. Pp. 41-59.
Nikonov V.G., Litvinenko V.S. About bijectivity of transformations determined by quasi-hadamard matrixes. Comp. nanotechnol. 2016. No. 1. Pp. 6-13. (In Rus.)
Nikonov V.G., Nikonov N.V. Features of threshold representations of k-valued functions. Transactions on Discrete Athematics. 2008. Vol. 11. No. 1. Pp. 60-85. (In Rus.)
Nikonov V.G. Classification of minimal basic representations of all Boolean functions in four variables. Review of Applied and Industrial Mathematics. Ser. Discrete Math. 1994. Vol. 1. No. 3. Pp. 458-545. (In Rus.)
Dertouzos М.L. Threshold logic: A synthesis approach. Cambridge, Massachusetts: MIT Press, 1965.
Butakov E.A. Methods of synthesis of linear devices from threshold elements. Moscow: Energy. 1970.
Zuev Yu.A. Threshold functions and threshold representations of Boolean functions. Mathematical Problems of Cybernetics. Issue 5. Moscow: Nauka, 1994. (In Rus.)
Nikonov V.G., Zobov A.I., Geometric approach to estimating the complexity of Boolean functions. Comp. nanotechnol. 2018. No. 3. Pp. 32-43. (In Rus.)
Kudryavtsev V.A. Summation of powers of natural numbers and Bernoulli numbers. Leningrad: United Scientific and Technical Publishing House of the NKTP USSR, 1936, 37 p.
Logachev O.A., Salnikov A.A., Smyshlyaev S.V., Yashchenko V.V. Boolean functions in coding theory and cryptology. 2nd ed., suppl. Moscow: MTsNMO, 2012. 584 p.
Logachev O.A., Fedorov S.N., Yashchenko V.V. Boolean functions as points on a hypersphere in euclidean space. Discrete Mathematics. 2018. Vol. 30. No. 1. Pp. 39-55. (In Rus.)
Nikonov V.G., Sarantsev A.V. Methods for compact realization of bijective mappings given by regular systems of the same type of Boolean functions. Bulletin of the Russian University of Friendship of Peoples. Series: Applied and Industrial Mathematics. 2003. Vol. 2. No. 1. Pp. 94-105. (In Rus.)
Yablonsky S.V. Introduction to discrete mathematics: Study guide for universities. 2nd ed., revised. and add. Moscow: Science. Ch. Ed. Physical-Mat. Lit. 384 p.
Agievich S.V., Afonenko A.A., On the properties of exponential substitutions. Vesti NAN Belarusi. 2005. No. 1. Pp. 106-112. (In Rus.)
Agievich S.V., Galinsky B. A., Mikulich N.D., Kharin U.S. Algorithm of block encryption BelT (In Rus.) URL: http://apmi.bsu.by/assets/files/agievich/BelT.pdf
Barreto P., Rijmen V. The ANUBIS block cipher. In: NESSIE submission. 2000.
Barreto P., Rijmen V. The KHAZAD block cipher. In: NESSIE submission. 2000.
Chabaud F., Vaudenay S. Links between differential and linear cryptanalysis // EUROCRYPT, Lect. Notes Comput. Sci. 1994. No. 950. Pp. 356-365.
Daemen J., Rijmen V. Probability distributions of correlations and differentials in block ciphers // J. Math. Crypt. 2007. No. 1. Pp. 221-242.
Menyachixin A.V. Spectral-linear and spectral-differential methods for constructing S-boxes with close to optimal values of cryptographic parameters. Mathematical Questions of Cryptography. 2017. Vol. 8. No. 2. Pp. 97-116.
Keywords:
threshold function, symmetric group, implementation of permutations, threshold basis, complexity of implementation, transposition, the algorithm for implementing permutations.


Related Articles

1. MATHEMATICAL MODELING, NUMERICAL METHODS AND COMPLEX PROGRAMS Pages: 7-14 Issue №9439
ABOUT THE NEW ALGORITM OF CHARACTERIZATION OF k-VALUED THRESHOLD FUNCTIONS
threshold function k-valued logic characterization of threshold functions growth factors the coefficients of increase
Show more
1. MATHEMATICAL MODELING, NUMERICAL METHODS AND COMPLEX PROGRAMS Pages: 6-13 Issue №6518
ABOUT BIJECTIVITY OF TRANSFORMATIONS DETERMINED BY QUASI-HADAMARD MATRIXES
bijective mapping threshold function quasidemocracy matrix
Show more
2. MATHEMATICAL MODELING, NUMERICAL METHODS AND COMPLEX PROGRAMS Pages: 26-30 Issue №5869
Geometrical approach to the argumentum of bijection of one coordinate-threshold reflection
bijective mapping threshold function multidimensional cones quasidemocracy matrix
Show more
Information Security Pages: 36-41 DOI: 10.33693/2313-223X-2023-10-2-36-41 Issue №23034
Construction of a Reversible Full-cycle Transformation in a Threshold Basis
substitution threshold function full cycle
Show more
2. MATHEMATICAL MODELING, NUMERICAL METHODS AND COMPLEX PROGRAMS Pages: 31-36 Issue №5869
The constructive method for synthesis of balanced k-valued algebraic threshold functions
multivalued logic threshold function algebraic threshold function balanced function
Show more
3. INFORMATION TECHNOLOGY AND AUTOMATION SYSTEMS Pages: 53-59 Issue №3742
ON A DECOMPOSITION OF BOOLEAN FUNCTIONS REPRESENTED BY QUADRATIC INEQUALITIES
Boolean functions threshold function decomposition quadratic inequalities
Show more
6. INFORMATION SECURITY Pages: 39-49 Issue №9439
ABOUT POSSIBILITY OF USING FRACTAL MODELS IN DATA SECURITY SYSTEM CONSTRUCTION
fractal protection of information function complications threshold function
Show more
INFORMATION SECURITY Pages: 132-139 Issue №11955
MODIFICATION OF A GEOMETRICAL ALGORITHM OF CHARACTERIZATIONk-VALUED THRESHOLD FUNCTIONS
threshold function k-valued logic geometric algorithm the characterization of threshold functions the proof of convergence
Show more