Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/B97182MaRDI QIDQ5307271zbMATH OpenOpenAlexFDO

Authors Jean-Sébastien Coron

Publication date 25 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97182

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Numerical computation of solutions to single equations (65H05) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• Finding a small root of a bivariate integer equation; factoring with high bits known
• An algorithm for finding small roots of multivariate polynomials over the integers
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• scientific article; zbMATH DE number 1182510

Cited in

(36)

• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• Small CRT-exponent RSA revisited
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• Fast rebalanced RSA signature scheme with typical prime generation
• A note on the bivariate Coppersmith theorem
• Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
• Attacking the linear congruential generator on elliptic curves via lattice techniques
• Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
• Finding a small root of a bivariate integer equation; factoring with high bits known
• A new partial key exposure attack on multi-power RSA
• A tool kit for partial key exposure attacks on RSA
• Implicit related-key factorization problem on the RSA cryptosystem
• An algorithm for finding small roots of multivariate polynomials over the integers
• On the Improvement of the BDF Attack on LSBS-RSA
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• scientific article; zbMATH DE number 1303120 (Why is no real title available?)
• scientific article; zbMATH DE number 1852134 (Why is no real title available?)
• Forty years of attacks on the RSA cryptosystem: a brief survey
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
• RSA Moduli with a Predetermined Portion: Techniques and Applications
• Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
• Small CRT-Exponent RSA Revisited
• Recovering a sum of two squares decomposition revisited
• Deterministic factoring with oracles
• Implicit-key attack on the RSA cryptosystem
• Finding small roots for bivariate polynomials over the ring of integers
• Revisiting RSA-polynomial problem and semiprime factorization
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
• Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
• Solving modular linear equations via automated Coppersmith and its applications
• Better bounds for finding fixed-degree isogenies via Coppersmith's method
• Trapdoor DDH groups from pairings and isogenies
• Cryptanalysis of RSA with two decryption exponents

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307271)