Paper 2017/481
A New Public-Key Cryptosystem via Mersenne Numbers
Divesh Aggarwal, Antoine Joux, 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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Contact author(s)
- divesh aggarwal @ gmail com
- History
- 2017-12-06: last of 4 revisions
- 2017-05-30: received
- See all versions
- Short URL
- https://ia.cr/2017/481
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/481,
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{https://eprint.iacr.org/2017/481}},
url = {https://eprint.iacr.org/2017/481}
}
