scientific article; zbMATH DE number 1182510
From MaRDI portal
Publication:4400575
zbMATH Open0922.11113MaRDI QIDQ4400575FDOQ4400575
Authors: Nicholas Howgrave-Graham 
Publication date: 3 October 1999
Title of this publication is not available (Why is that?)
Recommendations
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Cited In (only showing first 100 items - show all)
- Finding small roots for bivariate polynomials over the ring of integers
- Fast practical lattice reduction through iterated compression
- Partial key exposure attack on CRT-RSA
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- A new attack on some RSA variants
- Title not available (Why is that?)
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Forty years of attacks on the RSA cryptosystem: a brief survey
- An algorithm for finding small roots of multivariate polynomials over the integers
- Improved cryptanalysis of the multi-power RSA cryptosystem variant
- Generalized implicit factorization problem
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- \textit{Caveat implementor!} Key recovery attacks on MEGA
- Reconstructing points of superelliptic curves over a prime finite field
- Finding points on elliptic curves with Coppersmith's method
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Formalizing Coppersmith's method in Isabelle/HOL
- A bivariate polynomial-based cryptographic hard problem and its applications
- An exhaustive search method to find all small solutions of a multivariate modular linear equation
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Partial prime factor exposure attacks on some RSA variants
- Recovering zeros of polynomials modulo a prime
- A generalized attack on the multi-prime power RSA
- Implicit-key attack on the RSA cryptosystem
- Practical attacks on small private exponent RSA: new records and new insights
- Implicit related-key factorization problem on the RSA cryptosystem
- Solving modular cubic equations with Coppersmith's method
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- Cryptanalysis of the multi-power RSA cryptosystem variant
- Inferring sequences produced by the quadratic generator
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- A generalized attack on some variants of the RSA cryptosystem
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Generalized cryptanalysis of small CRT-exponent RSA
- On the optimality of lattices for the Coppersmith technique
- Title not available (Why is that?)
- Revisiting prime power RSA
- On optimal bounds of small inverse problems and approximate GCD problems with higher degree
- Attacking RSA with a composed decryption exponent using unravelled linearization
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- An improved analysis on three variants of the RSA cryptosystem
- A unified framework for small secret exponent attack on RSA
- Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- 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
- Some applications of lattice based root finding techniques
- The better bound of private key in RSA with unbalanced primes
- A new partial key exposure attack on multi-power RSA
- Further cryptanalysis of a type of RSA variants
- Divisors in residue classes, constructively
- Small CRT-exponent RSA revisited
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Improved results on cryptanalysis of prime power RSA
- Some lattice attacks on DSA and ECDSA
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Partial key exposure: generalized framework to attack RSA
- Cryptanalysis of RSA with two decryption exponents
- A unified method for private exponent attacks on RSA using lattices
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- Partial key exposure attack on short secret exponent CRT-RSA
- Combined attack on CRT-RSA. Why public verification must not be public?
- List decoding of number field codes
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Classical attacks on a variant of the RSA cryptosystem
- Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
- When e-th Roots Become Easier Than Factoring
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Cryptanalysis of RSA variants with primes sharing most significant bits
- Cryptanalysis of RSA for a special case with \(d > e\)
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Using LLL-reduction for solving RSA and factorization problems
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Finding smooth integers in short intervals using CRT decoding
- Improved cryptanalysis of the multi-prime \(\varphi\)-hiding assumption
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Another Generalization of Wiener’s Attack on RSA
- 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
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Cryptanalysis of Prime Power RSA with two private exponents
- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- Small CRT-Exponent RSA Revisited
- A method for obtaining digital signatures and public-key cryptosystems
- Finding a small root of a univariate modular equation
- A tool kit for partial key exposure attacks on RSA
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Cryptanalysis of Dual RSA
- A new attack on RSA and Demytko's elliptic curve cryptosystem
- Deterministic factoring with oracles
- Symplectic Lattice Reduction and NTRU
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400575)
