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