Paper 2017/481

A New Public-Key Cryptosystem via Mersenne Numbers

Divesh Aggarwal, Antoine Joux, Anupam Prakash, and Miklos Santha


In this work, we propose a new public-key cryptosystem whose security is based on the computational intractability of the following problem: Given a Mersenne number p = 2^n - 1, where n is a prime, a positive integer h, and two n-bit integers T, R, decide whether their exist n-bit integers F, G each of Hamming weight less than h such that T = F R + G modulo p.

Available format(s)
Publication info
Preprint. MINOR revision.
Contact author(s)
divesh aggarwal @ gmail com
2017-12-06: last of 4 revisions
2017-05-30: received
See all versions
Short URL
Creative Commons Attribution


      author = {Divesh Aggarwal and Antoine Joux and Anupam Prakash and Miklos Santha},
      title = {A New Public-Key Cryptosystem via Mersenne Numbers},
      howpublished = {Cryptology ePrint Archive, Paper 2017/481},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.