Improving bounds on elliptic curve hidden number problem for ECDH key exchange

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the modular inversion hidden number problem
Factoring polynomials with rational coefficients
Efficient computation of zero-dimensional Gröbner bases by change of ordering
Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
New results on Modular Inversion Hidden Number problem and inversive congruential generator
Improved factorization of \(N=p^rq^s\)
Cryptanalysis of elliptic curve hidden number problem from PKC 2017
Modern Computer Algebra
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
Faster LLL-type Reduction of Lattice Bases
SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
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
An LLL Algorithm with Quadratic Complexity
Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
Using LLL-Reduction for Solving RSA and Factorization Problems
Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
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
Small CRT-Exponent RSA Revisited

This page was built for publication: Improving bounds on elliptic curve hidden number problem for ECDH key exchange