年間 12 号発行
ISSN 印刷: 0040-2508
ISSN オンライン: 1943-6009
Indexed in
ANALYSIS OF THE IMPLEMENTATION COMPLEXITY OF CRYPTOSYSTEM BASED ON THE SUZUKI GROUP
要約
Implementations for cryptosystems of finite groups based on the logarithmic signature and covering are considered. A logarithmic signature is exemplified by a permutation group with the asymmetry of encryption and decryption algorithms. Decryption of the improved cryptosystem MST3 in Suzuki 2-group with the order of the group q2 is given. The Suzuki 2-group use has a significant advantage in implementation, due to the large center and simple group operation. Cost estimates for encryption, decryption and comparison with the RSA algorithm are obtained.
-
Wagner, N.R. and Magyarik, M.R., (1984) , A Public Key Cryptosystem Based on the Word Problem, Advances in Cryptology. Proceedings of CRYPTO, pp. 19-36, edited by G.R. Blakley and D. Chaum, Lecture Notes in Computer Science 196. Berlin: Springer, 1985.
-
Wagner, N.R., (1984) , Searching for Public-Key Cryptosystems, Proceedings of the Symposium on Security and Privacy (SSP ’84), pp. 91-98, Los Alamitos, CA: IEEE Computer Society Press.
-
Magliveras, S.S., (1986) , A Cryptosystem from Logarithmic Signatures of Finite Groups, Proceedings of the 29th Midwest Symposium on Circuits and Systems, pp. 972-975. Amsterdam: Elsevier Publishing Company.
-
Lempken, W., Magliveras, S.S., Tran van Trung, and Wei, W. (2009), A public key cryptosystem based on non-abelian finite groups, J. of Cryptology, 22, pp. 62-74.
-
Higman, G., (1963) , Suzuki 2-groups.Ill, J. Mathematic, 7, pp. 79-96.
-
Pavol Svaba, (2011) , Covers and logarithmic signatures of finite groups in cryptography, Dissertation, Bratislava, Slowakische Republik.
-
Koliechkina Liudmyla M., Nagirna Alla M., The Practical Aspect of Using a Combinatorial Model on the Configuration of Combinations, Control systems and computers, 5 (283), 2019. Crossref