A new cryptosystem using generalized Mersenne primes

DOI10.1007/s40324-015-0056-7zbMath1397.94075OpenAlexW2245489725MaRDI QIDQ258874

Himashree Kalita, Jayanta Kalita, Azizul Hoque

Publication date: 10 March 2016

Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40324-015-0056-7

zbMATH Keywords

discrete logarithm problempublic key cryptosystemcubic rootgeneralized Mersenne primes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Breaking RSA may be as difficult as factoring
• On generalized Mersenne prime
• A key distribution system equivalent to factoring
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• On generalized mersenne primes and class-numbers of equivalent quadratic fields and cyclotomic fields
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A new cryptosystem using generalized Mersenne primes