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: | , , , , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2020
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/138108 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|