Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith

DOI10.1007/978-981-99-8730-6_2zbMATH Open1547.94393MaRDI QIDQ6604865FDOQ6604865

Authors: Jonas Meers, Julian Nowakowski 

Publication date: 13 September 2024

zbMATH Keywords

isogenieshidden number problemCSIDHCSURFCoppersmith

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic theory of abelian varieties (14K05) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• The Arithmetic of Elliptic Curves
• Title not available (Why is that?)
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Title not available (Why is that?)
• Nonsingular plane cubic curves over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• CSIDH on the Surface
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• CSIDH: an efficient post-quantum commutative group action
• Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
• On the Security of Supersingular Isogeny Cryptosystems
• An efficient authenticated key exchange from random self-reducibility on CSIDH
• Practical isogeny-based key-exchange with optimal tightness
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Computing isogenies between Montgomery curves using the action of \((0,0)\)
• On the Bit Security of Elliptic Curve Diffie–Hellman
• Title not available (Why is that?)
• Finding a Small Root of a Univariate Modular Equation
• Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
• Attacking power generators using unravelled linearization: when do we output too much?
• Small CRT-Exponent RSA Revisited
• On collisions related to an ideal class of order 3 in CSIDH
• Rational isogenies from irrational endomorphisms
• Small CRT-exponent RSA revisited
• Cryptographic group actions and applications
• GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias
• Orientations and the supersingular endomorphism ring problem
• Radical isogenies
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• Partial key exposure attack on short secret exponent CRT-RSA
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017
• On the Bits of Elliptic Curve Diffie-Hellman Keys
• Improving bounds on elliptic curve hidden number problem for ECDH key exchange
• Title not available (Why is that?)
• Breaking SIDH in polynomial time
• An efficient key recovery attack on SIDH
• A direct key recovery attack on SIDH
• Group action key encapsulation and non-interactive key exchange in the QROM
• Lattice-Based Integer Factorisation: An Introduction to Coppersmith’s Method
• Full quantum equivalence of group action DLog and CDH, and more
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications

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)