TY - JOUR
T1 - Close values of shifted modular inversions and the decisional modular inversion hidden number problem
AU - Shparlinski, Igor E.
PY - 2015/5/1
Y1 - 2015/5/1
N2 - We give deterministic polynomial time algorithms for two different decision version the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N. A. Howgrave-Graham in 2001. For example, for one of our algorithms we need to be given about 1=2 of the bits of each inversion, while for the computational version the best known algorithm requires about 2=3 of the bits and is probabilistic.
AB - We give deterministic polynomial time algorithms for two different decision version the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N. A. Howgrave-Graham in 2001. For example, for one of our algorithms we need to be given about 1=2 of the bits of each inversion, while for the computational version the best known algorithm requires about 2=3 of the bits and is probabilistic.
UR - http://www.scopus.com/inward/record.url?scp=84928997957&partnerID=8YFLogxK
UR - http://purl.org/au-research/grants/arc/DP130100237
U2 - 10.3934/amc.2015.9.169
DO - 10.3934/amc.2015.9.169
M3 - Article
AN - SCOPUS:84928997957
SN - 1930-5346
VL - 9
SP - 169
EP - 176
JO - Advances in Mathematics of Communications
JF - Advances in Mathematics of Communications
IS - 2
ER -