Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
From MaRDI portal
Publication:6604865
Recommendations
Cites work
- scientific article; zbMATH DE number 1588483 (Why is no real title available?)
- scientific article; zbMATH DE number 4035724 (Why is no real title available?)
- scientific article; zbMATH DE number 2081057 (Why is no real title available?)
- scientific article; zbMATH DE number 1842493 (Why is no real title available?)
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A direct key recovery attack on SIDH
- An efficient authenticated key exchange from random self-reducibility on CSIDH
- An efficient key recovery attack on SIDH
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Attacking power generators using unravelled linearization: when do we output too much?
- Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
- Breaking SIDH in polynomial time
- CSIDH on the surface
- CSIDH: an efficient post-quantum commutative group action
- Computing isogenies between Montgomery curves using the action of \((0,0)\)
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Cryptographic group actions and applications
- 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
- Full quantum equivalence of group action DLog and CDH, and more
- GLV/GLS decomposition, power analysis, and attacks on ECDSA signatures with single-bit nonce bias
- Group action key encapsulation and non-interactive key exchange in the QROM
- Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Lattice-based integer factorisation: an introduction to Coppersmith's method
- Nonsingular plane cubic curves over finite fields
- On collisions related to an ideal class of order 3 in CSIDH
- On the Bits of Elliptic Curve Diffie-Hellman Keys
- On the Security of Supersingular Isogeny Cryptosystems
- On the bit security of elliptic curve Diffie-Hellman
- Orientations and the supersingular endomorphism ring problem
- Partial key exposure attack on short secret exponent CRT-RSA
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Practical isogeny-based key-exchange with optimal tightness
- Radical isogenies
- Rational isogenies from irrational endomorphisms
- Small CRT-Exponent RSA Revisited
- Small CRT-exponent RSA revisited
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The Arithmetic of Elliptic Curves
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
This page was built for publication: Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604865)
