Solving Hidden Number Problem with One Bit Oracle and Advice
From MaRDI portal
Publication:3183573
DOI10.1007/978-3-642-03356-8_20zbMath1252.94040OpenAlexW1835602288MaRDI QIDQ3183573
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_20
Related Items (10)
Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ The Multivariate Hidden Number Problem ⋮ Analysis of hidden number problem with hidden multiplier ⋮ On the modular inversion hidden number problem ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Unnamed Item ⋮ Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values ⋮ Close values of shifted modular inversions and the decisional modular inversion hidden number problem ⋮ Pseudorandom Functions: Three Decades Later ⋮ A multiscale sub-linear time Fourier algorithm for noisy data
This page was built for publication: Solving Hidden Number Problem with One Bit Oracle and Advice
