Cryptanalysis of elliptic curve hidden number problem from PKC 2017

DOI10.1007/s10623-019-00685-yzbMath1452.94093OpenAlexW2981225489WikidataQ127019812 ScholiaQ127019812MaRDI QIDQ2291665

Jun Xu, Santanu Sarkar, Lei Hu

Publication date: 31 January 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-019-00685-y

zbMATH Keywords

hidden number problembit securityCoppersmith techniqueelliptic curve Diffie-Hellman

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Fast practical lattice reduction through iterated compression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the modular inversion hidden number problem
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• On the bit security of the Diffie-Hellman key
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Mathematics of Public Key Cryptography
• Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• An LLL Algorithm with Quadratic Complexity
• Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
• Using LLL-Reduction for Solving RSA and Factorization Problems
• Ideals, Varieties, and Algorithms
• On the Bits of Elliptic Curve Diffie-Hellman Keys
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• On the Bit Security of Elliptic Curve Diffie–Hellman