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 is...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/138108 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |