Analysis of hidden number problem with hidden multiplier

DOI10.3934/amc.2017059zbMath1378.11106OpenAlexW2775049851MaRDI QIDQ1691252

Santanu Sarkar

Publication date: 15 January 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2017059

zbMATH Keywords

latticeLLL algorithmsequencehidden number problem with hidden multiplier

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Solving Hidden Number Problem with One Bit Oracle and Advice
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Factorization of a 768-Bit RSA Modulus
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Minkowski's Convex Body Theorem and Integer Programming
• Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
• Lattice attacks on digital signature schemes

This page was built for publication: Analysis of hidden number problem with hidden multiplier