Cryptology ePrint Archive: Report 2017/481

A New Public-Key Cryptosystem via Mersenne Numbers

Divesh Aggarwal and Antoine Joux and Anupam Prakash and Miklos Santha

Abstract: 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.

Category / Keywords:

Date: received 29 May 2017, last revised 5 Dec 2017

Contact author: divesh aggarwal at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20171206:004924 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]