Abstract
In this paper we introduce a secure and efficient public key cryptosystem using generalized Mersenne primes based on two hard problems: the cubic root extraction modulo a composite integer and the discrete logarithm problem (DLP). These two problems are combined during the key generation, encryption and decryption phases. To break the scheme, an attacker has to solve the cubic root computation and the DLP separately which is computationally infeasible.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bach, E.: Discrete Logarithms and Factoring, Technical Report UCB 84/186. Computer Science Division, University of California, Berkeley (1984)
Brown, D.R.L.: Breaking RSA may be as difficult as factoring. In: Cryptology. ePrint Archive, Report 205/380 (2006)
Castagnos, G.: An efficient probabilistic public-key cryptosystem over quadratic fields quotients. Finite Field Their Appl. 13, 563–576 (2007)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)
El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469–472 (1985)
Goldwasser, S., Bellare, M.: Lecture Notes on Cryptography, 2001 (Online). Available at http://www.cs.ucsd.edu/users/mihir/papers/gb.html
Hastad, J., Schrift, A., Shamir, A.: The discrete logarithm modulo a composite hides \(O(n)\) bits. J. Comput. Syst. Sci. 47(3), 376–404 (1993)
Hoque, A., Saikia, H.K.: On generalized Mersenne prime. SeMA J. 66, 1–7 (2014)
Hoque, A., Saikia, H.K.: On generalized Mersenne primes and class-numbers of equivalent quadratic fields and cyclotomic fields. SeMA J. 67, 71–75 (2015)
Ismail, E.S., Hijazi, M.S.: New cryptosystem using multiple cryptographic assumptions. J. Comput. Sci. 7(12), 1765–1769 (2011)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, New York (1997)
McCurley, K.S.: A key distribution equivalent to factoring. J. Cryptol. 1, 95–105 (1988)
Pointcheval, D.: The composite discrete logarithm and a signature scheme based on discrete logarithms. In: Proceedings of the 2000 International Workshop on Practice and Theory in Public KeyCryptography (PKC’2000), LNCS 1751, Springer, Berlin, Heidelberg, pp. 113–128 (2000)
Rabin, M.: Digitalized Signatures and Public-Key Functions as Intractable as Factorization. MIT Laboratory for Computer Science, Technical Report MIT/LCS/TR-212, Cambridge, USA (1979)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
Shor, P.: Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Comput. 26, 14–84 (1997)
Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (1995)
Acknowledgments
The corresponding author acknowledges UGC for JRF. The author’s thank to Prof. H. K. Saikia, Head, Department of Mathematics for her valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kalita, J., Hoque, A. & Kalita, H. A new cryptosystem using generalized Mersenne primes. SeMA 73, 77–83 (2016). https://doi.org/10.1007/s40324-015-0056-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40324-015-0056-7