Revisiting modular inversion hidden number problem and its applications

Revisiting modular inversion hidden number problem and its applications

The Modular Inversion Hidden Number Problem (MIHNP), which was proposed at Asiacrypt 2001 by Boneh, Halevi, and Howgrave-Graham, is summarized as follows: Assume that the δ most significant bits of z are denoted by MSBδ(z). The goal is to retrieve the hidden number α ϵ ℤp given many samples (ti,MSBδ...

Full description

Saved in:
Bibliographic Details
Main Authors: Xu, Jun, Sarkar, Santanu, Hu, Lei, Wang, Huaxiong, Pan, Yanbin
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2023
Subjects:
Science::Mathematics
LLL Algorithm
Coppersmith Technique
Online Access:https://hdl.handle.net/10356/170743
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English

Internet

https://hdl.handle.net/10356/170743

Similar Items