Advances in Cryptology - EUROCRYPT 2004
DOI10.1007/B97182zbMATH Open1122.13302OpenAlexW2477185671MaRDI QIDQ5307271FDOQ5307271
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
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Polynomials, factorization in commutative rings (13P05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Numerical computation of solutions to single equations (65H05)
Cited In (30)
- Finding small roots for bivariate polynomials over the ring of integers
- Revisiting RSA-polynomial problem and semiprime factorization
- Forty years of attacks on the RSA cryptosystem: A brief survey
- Title not available (Why is that?)
- Trapdoor DDH groups from pairings and isogenies
- A Tool Kit for Partial Key Exposure Attacks on RSA
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Small CRT-exponent RSA revisited
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Cryptanalysis of RSA with two decryption exponents
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- A note on the bivariate Coppersmith theorem
- A New Partial Key Exposure Attack on Multi-power RSA
- An algorithm for finding small roots of multivariate polynomials over the integers
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Title not available (Why is that?)
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Fast rebalanced RSA signature scheme with typical prime generation
- Small CRT-Exponent RSA Revisited
- Attacking the linear congruential generator on elliptic curves via lattice techniques
- On the Improvement of the BDF Attack on LSBS-RSA
- Implicit-key attack on the RSA cryptosystem
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Deterministic factoring with oracles
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)
