A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
From MaRDI portal
Publication:5459084
DOI10.1007/11935230_18zbMATH Open1172.94577OpenAlexW1961022628MaRDI QIDQ5459084FDOQ5459084
Authors: Ellen Jochemsz, Alexander May 
Publication date: 24 April 2008
Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11935230_18
Recommendations
- scientific article; zbMATH DE number 1182510
- An algorithm for finding small roots of multivariate polynomials over the integers
- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- scientific article; zbMATH DE number 1303120
Cited In (51)
- On the possibility of a backdoor in the Micali-Schnorr generator
- Finding small roots for bivariate polynomials over the ring of integers
- Revisiting RSA-polynomial problem and semiprime factorization
- Cryptanalysis of the RSA variant based on cubic Pell equation
- A generalized attack on some variants of the RSA cryptosystem
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- On the optimality of lattices for the Coppersmith technique
- Attacking RSA with a composed decryption exponent using unravelled linearization
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- An improved analysis on three variants of the RSA cryptosystem
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Further cryptanalysis of a type of RSA variants
- Small CRT-exponent RSA revisited
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Improved results on cryptanalysis of prime power RSA
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Partial key exposure: generalized framework to attack RSA
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Cryptanalysis of RSA with two decryption exponents
- Cryptanalysis of RSA with more than one decryption exponent
- A unified method for private exponent attacks on RSA using lattices
- Combined attack on CRT-RSA. Why public verification must not be public?
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Title not available (Why is that?)
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Classical attacks on a variant of the RSA cryptosystem
- On the Security of Supersingular Isogeny Cryptosystems
- Attacks on pseudo random number generators hiding a linear structure
- Using LLL-reduction for solving RSA and factorization problems
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
- On the security of multi-prime RSA
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Reconstructing points of superelliptic curves over a prime finite field
- Finding points on elliptic curves with Coppersmith's method
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- A New Search Pattern in Multiple Residue Method (MRM) and Its Importance in the Cryptanalysis of the RSA
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Partial prime factor exposure attacks on some RSA variants
- Recovering zeros of polynomials modulo a prime
- Fast rebalanced RSA signature scheme with typical prime generation
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods
- Small CRT-Exponent RSA Revisited
- A tool kit for partial key exposure attacks on RSA
- Implicit-key attack on the RSA cryptosystem
- Cryptanalysis of Dual RSA
- Solving modular cubic equations with Coppersmith's method
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Inferring sequences produced by the quadratic generator
Uses Software
This page was built for publication: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459084)
