Analysis of the Implementation and Computational Costs for the Cryptosystems on Suzuki Group

Abstract

The paper considers the main implementations of cryptosystems in groups and an analysis of the estimation of complexity of calculations. The analysis of the cryptosystems implementation based on Suzuki group is presented. The design and implementation peculiarities of the Suzuki 2-group based MST3 cryptosystem are analyzed. The comparative results of encryption and decryption computation costs for the finite field of 128 bits, 256 bits, as well as implementation for the RSA algorithm are obtained. It follows from the evaluation that, for example, the encryption and decryption time of the RSA algorithm is 10 times bigger than the MST3 cryptosystem, but it much more cost effective in terms of the size of private and public keys.