Cryptanalysis of elliptic curve hidden number problem from PKC 2017
From MaRDI portal
Publication:2291665
Recommendations
- An attack on disguised elliptic curves
- Extended Hidden Number Problem and Its Cryptanalytic Applications
- Cryptanalysis of a homomorphic encryption scheme over integers
- Cryptanalysis of PKP: A new approach
- Cryptanalysis of multi-prime \(\varPhi \)-hiding assumption
- Hessian elliptic curves and side-channel attacks
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- scientific article; zbMATH DE number 1846035
- Cryptography on elliptic curves over \(p\) -adic number fields
- Cryptanalysis of a homomorphic encryption scheme
Cites work
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- An LLL algorithm with quadratic complexity
- Attacking power generators using unravelled linearization: when do we output too much?
- Certificates of recoverability with scalable recovery agent security
- Factoring polynomials with rational coefficients
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Finding small roots of univariate modular equations revisited
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Hidden number problem with the trace and bit security of XTR and LUC
- Ideals, Varieties, and Algorithms
- Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
- Mathematics of public key cryptography.
- On the bit security of elliptic curve Diffie-Hellman
- On the bit security of the Diffie-Hellman key
- On the Bits of Elliptic Curve Diffie-Hellman Keys
- On the modular inversion hidden number problem
- On the security of Diffie-Hellman bits
- Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
- 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
- The decision Diffie-Hellman problem
- The modular inversion hidden number problem
- Using LLL-reduction for solving RSA and factorization problems
Cited in
(6)- On the Bits of Elliptic Curve Diffie-Hellman Keys
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Fast practical lattice reduction through iterated compression
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Solving multivariate Coppersmith problems with known moduli
- New results on elliptic curve hidden number problem for ECDH key exchange
This page was built for publication: Cryptanalysis of elliptic curve hidden number problem from PKC 2017
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291665)