Modified Matrix Modular Cryptosystems
Journal of Advances in Mathematics and Computer Science · pp. 613–636 · Published 6 Dec 2014
10.9734/BJMCS/2015/14321Abstract
The Basic Matrix Modular Cryptosystem (BMMC) is a public-key cryptosystem, which uses some matrix modular exponentiations in the matrix ring over the residue ring modulo n. The aim of this article is to decrease the number of these exponentiations and consequently to accelerate the execution of encryption algorithm. There are two ways to reach this aim. First way is to determine the large abelian subgroup in general linear group over the large residue ring and to choose the session keys in this subgroup, what will be to give the encryption without exponentiations. Other way is to use random integral exponent of the given matrix in the public key as session key and this will be the only exponentiation in encryption algorithm. A discussion about the security of built modifications made in the article shows that the level of security is high enough for an appropriate choice of parameters of the cryptosystems, namely, the lower bound for the selection of secure modulus n is 40-bit integer. Both modified cryptosystems are faster than BMMC and balanced with respect to a pair of security – efficiency, and BMMC is much faster than RSA.
References (9)
- 1 Algorithms for quantum computation: discrete logarithms and factoring [DOI]
- 2 Non-commutative Cryptography and Complexity of Group-theoretic Problems [DOI]
- 3 New Public Key Cryptosystem Using Finite Non Abelian Groups [DOI]
- 4 A Simple Generalization of the ElGamal Cryptosystem to Non-Abelian Groups II [DOI]
- 5 BRAID GROUP CRYPTOGRAPHY [DOI]
- 6 Cryptosystems in automorphism groups of group rings of Abelian groups [DOI]
- 7 New Practical Algebraic Public-Key Cryptosystem and Some Related Algebraic and Computational Aspects [DOI]
- 8 Cryptanalysis of three matrix-based key establishment protocols [DOI]
- 9 Handbook of applied cryptography [DOI]
Cited by 8
Kashif Ahmed, S. Pal, R. Mohan · Cryptologia · 2022
V. Roman'kov · arXiv.org · 2018
S. K. Rososhek · 2016
G. J. Lanel, T. Jinasena, B. Welihinda · Journal of information science and engineering · 2022
Tzu-Chun Lin · International Journal of Network Security · 2018
Huawei Huang, Chunhua Li, Lunzhi Deng · Applied Sciences · 2022
Showing 6 of 8 known citations — external sources report more than can currently be individually listed.
Related research
- Identification, Generating and Classification of Morphisms between Finite Groups — shares topic coverage
- Fast and Secure Modular Matrix Based Digital Signature — shares topic coverage
Article metrics
Real usage data collected on this platform.
12
Page views
0
PDF downloads
7
Outbound clicks
8
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.