Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-96878-0_16 | ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III |
DocType | Volume | ISSN |
Conference | 10993 | 0302-9743 |
Citations | PageRank | References |
2 | 0.38 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Divesh Aggarwal | 1 | 186 | 17.99 |
| Antoine Joux | 2 | 2727 | 256.45 |
| Anupam Prakash | 3 | 21 | 3.90 |
| Miklos Santha | 4 | 728 | 92.42 |