## CryptoDB

### Anupam Prakash

#### Publications

Year
Venue
Title
2018
CRYPTO
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$ p=2n-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\cdot R + G$ T=F·R+G modulo p.

#### Coauthors

Divesh Aggarwal (1)
Antoine Joux (1)
Miklos Santha (1)