A new cryptosystem using generalized Mersenne primes

DOI10.1007/S40324-015-0056-7MaRDI QIDQ258874zbMATH OpenOpenAlexFDO

Authors Jayanta Kalita, Azizul Hoque, Himashree Kalita

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

cubic rootdiscrete logarithm problemgeneralized Mersenne primespublic key cryptosystem

Mathematics Subject Classification ID

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

Recommendations

• A new public-key cryptosystem via Mersenne numbers
• On using Mersenne primes in the public-key encryption
• A public key cryptosystem based on three new provable problems
• A cryptosystem based on double generalized discrete logarithm problem
• On the hardness of the Mersenne Low Hamming Ratio assumption

Cites work

• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 774344 (Why is no real title available?)
• scientific article; zbMATH DE number 1440053 (Why is no real title available?)
• A key distribution system equivalent to factoring
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• Breaking RSA may be as difficult as factoring
• New directions in cryptography
• On generalized Mersenne prime
• On generalized mersenne primes and class-numbers of equivalent quadratic fields and cyclotomic fields
• The discrete logarithm modulo a composite hides \(O(n)\) bits

Cited in

(5)

• Improved cryptanalysis of the AJPS Mersenne based cryptosystem
• On the hardness of the Mersenne Low Hamming Ratio assumption
• A public key cryptosystem based on three new provable problems
• A new public-key cryptosystem via Mersenne numbers
• On using Mersenne primes in the public-key encryption

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258874)