Abstract
A cryptographic system based on an ordered system of generators of symmetric group Sn is proposed. The role of a private key is played by the system of generators, and a cryptoanalyst knows only the degree of the symmetric group along with the observed encrypted message.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. A. Kalinchuk and Yu. L. Sagalovich, “An Ordered System of Generators of a Symmetric Group for Solution of Commutation Problems,” Avtom. Telemekh., No. 2, 142–152 (2009).
S. A. Kalinchuk and Yu. L. Sagalovich, “The Problem of Minimal Ordered Basis of Symmetric Group,” in Proc. Tenth Int. Workshop Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, Russia, Sept. 3-9, 2006 ((Nauka, Moscow, 2006)), pp. 139–142.
S. A. Kalinchuk and Yu. L. Sagalovich, “The Least Known Length of Ordered Basis of Symmetric Group,” in Proc. Eleventh Int. Workshop Algebraic and Combinatorial Coding Theory (ACCT-11), Pamporovo, Bulgaria, June 16–22, 2008 (Bulgarian Acad. of Science, 2008) pp. 134–239.
Additional information
Original Russian Text © S.A. Kalinchuk, Yu.L. Sagalovich, 2009, published in Informatsionnye Protsessy, 2009, Vol. 9, No. 3, pp. 138–146.
Rights and permissions
About this article
Cite this article
Kalinchuk, S.A., Sagalovich, Y.L. Cryptographic capabilities of an ordered system of generators of a symmetric group. J. Commun. Technol. Electron. 55, 1485–1490 (2010). https://doi.org/10.1134/S1064226910120223
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064226910120223