[Resource Topic] 2017/481: A New Public-Key Cryptosystem via Mersenne Numbers

Welcome to the resource topic for 2017/481

A New Public-Key Cryptosystem via Mersenne Numbers

Authors: Divesh Aggarwal, Antoine Joux, Anupam Prakash, 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.

ePrint: https://eprint.iacr.org/2017/481

Talk: https://www.youtube.com/watch?v=w68k-x1kV30

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .