Please use this identifier to cite or link to this item:
Title: Cryptographic Key Exchange Method for Data Factorial Coding
Authors: Фауре, Еміль Віталійович
Щерба, Анатолій Іванович
Васіліу, Євген Вікторович
Фесенко, Андрій Олексійович
Keywords: cryptography;method;key exchange;permutation;factorial coding
Issue Date: 2020
Publisher: International Workshop on Cyber Hygiene (CybHyg-2019), Kyiv, Ukraine, November 30, 2019. CEUR Workshop Proceedings. Vol. 2654
Abstract: The paper proposes a new cryptographic key exchange method. The basic idea of the proposed method is to use a permutation of a given set as a transformation object. The mathematical background of the method is the property of permutations to be decomposed into the product of disjoint cycles, the property of unique factorization of the product of disjoint cycles raised to the powers smaller than their order, and the complexity of factorization of the product of permutations whose cycles are noncommutative. The conditions to be met by the transformation parameters are defined. The concepts of cycle and block-noncommutative permutations are introduced. These properties of two permutations known to all participants in information exchange are sufficient for the correct operation of the method. The key space cardinality of the values of cycles’ exponents of two open permutations is investigated. It is shown that this cardinality is maximized if the disjoint cycles in the decomposition of open permutations are 3-cycles. The block diagram of a cryptographic system that implements the proposed method is investigated. Its work is described. The proposed method and system make it possible to generate a cryptographic key for information factorial coding without using a secure communication channel. They can also be used to form a non-permutation key.
ISSN: 1613-0073
First Page: 643
End Page: 664
Appears in Collections:Наукові публікації викладачів (ФІТІС)

Files in This Item:
File Description SizeFormat 
paper50.pdf584.48 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.