New results on modular inversion hidden number problem and inversive congruential generator
The Modular Inversion Hidden Number Problem (MIHNP), introduced by Boneh, Halevi and Howgrave-Graham in Asiacrypt 2001, is briefly described as follows: Let MSB𝛿(𝑧) refer to the δ most significant bits of z. Given many samples(𝑡𝑖,MSB𝛿((𝛼+𝑡𝑖)−1mod𝑝))(ti,MSBδ((α+ti)−1modp)) for random 𝑡𝑖∈ℤ𝑝, the goal...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/138108 |