scientific article; zbMATH DE number 1182510
From MaRDI portal
Publication:4400575
Recommendations
Cited in
(only showing first 100 items - show all)- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- About LLL reduction algorithms when solving the HNP problem and their comparative analysis
- A new generalized lattice attack against a family of RSA-like cryptosystems
- A method for obtaining digital signatures and public-key cryptosystems
- Small CRT-Exponent RSA Revisited
- Finding a small root of a univariate modular equation
- A tool kit for partial key exposure attacks on RSA
- A generalized attack on the multi-prime power RSA
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Implicit-key attack on the RSA cryptosystem
- Cryptanalysis of Dual RSA
- Practical attacks on small private exponent RSA: new records and new insights
- A novel cryptanalytic attack on a family of RSA-like cryptosystems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Implicit related-key factorization problem on the RSA cryptosystem
- A new attack on RSA and Demytko's elliptic curve cryptosystem
- Symplectic Lattice Reduction and NTRU
- Deterministic factoring with oracles
- 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
- Advances in Cryptology - EUROCRYPT 2004
- Predicting nonlinear pseudorandom number generators
- Towards optimal bounds for implicit factorization problem
- Further cryptanalysis of some variants of the RSA cryptosystem
- A new public key encryption scheme based on the cubic Pell curve using encoding functions
- 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
- Finding small roots for bivariate polynomials over the ring of integers
- 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
- Enhanced bound for the commutative isogeny hidden number problem in CSURF
- Revisiting prime power RSA
- On the optimality of lattices for the Coppersmith technique
- Generalized cryptanalysis of small CRT-exponent RSA
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- On optimal bounds of small inverse problems and approximate GCD problems with higher degree
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Attacking RSA with a composed decryption exponent using unravelled linearization
- Small secret exponent attack on RSA variant with modulus N=p^rq
- An improved analysis on three variants of the RSA cryptosystem
- A unified framework for small secret exponent attack on RSA
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA
- Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
- Some applications of lattice based root finding techniques
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Fast practical lattice reduction through iterated compression
- Partial key exposure attack on CRT-RSA
- The better bound of private key in RSA with unbalanced primes
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- Fault attacks on multi-prime RSA signatures
- A new partial key exposure attack on multi-power RSA
- Small CRT-exponent RSA revisited
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Some lattice attacks on DSA and ECDSA
- Further cryptanalysis of a type of RSA variants
- Improved results on cryptanalysis of prime power RSA
- Divisors in residue classes, constructively
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Cryptanalysis of RSA with two decryption exponents
- Partial key exposure: generalized framework to attack RSA
- A new attack on some RSA variants
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- A unified method for private exponent attacks on RSA using lattices
- 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
- scientific article; zbMATH DE number 7528065 (Why is no real title available?)
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Cryptanalysis of a new variant of the RSA cryptosystem
- SAT and lattice reduction for integer factorization
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Classical attacks on a variant of the RSA cryptosystem
- New results on elliptic curve hidden number problem for ECDH key exchange
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- An algorithm for finding small roots of multivariate polynomials over the integers
- Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
- A generalized partial exposure lattice attack against an RSA variant based on cubic Pell curves
- Improved cryptanalysis of the multi-power RSA cryptosystem variant
- 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\)
- A more complete cryptanalysis of the RSA-polynomial problem
- 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
- Generalized implicit factorization problem
- 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
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- New results on the -hiding assumption and factoring related RSA moduli
- Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
- Improved cryptanalysis of the multi-prime -hiding assumption
- \textit{Caveat implementor!} Key recovery attacks on MEGA
- Reconstructing points of superelliptic curves over a prime finite field
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)
