Finding a small root of a univariate modular equation
From MaRDI portal
Recommendations
Cited in
(82)- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- On the optimality of lattices for the Coppersmith technique
- Optimal security proofs for full domain hash. Revisited
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption
- Small CRT-exponent RSA revisited
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Generalized cryptanalysis of small CRT-exponent RSA
- A new parallel lattice reduction algorithm for BKZ reduced bases
- Formally verified certificate checkers for hardest-to-round computation
- An efficient probabilistic public-key cryptosystem over quadratic fields quotients
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- An improved method for predicting truncated multiple recursive generators with unknown parameters
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods
- An exhaustive search method to find all small solutions of a multivariate modular linear equation
- Finding a small root of a bivariate integer equation; factoring with high bits known
- A unified framework for small secret exponent attack on RSA
- A new partial key exposure attack on multi-power RSA
- A tool kit for partial key exposure attacks on RSA
- Partial bits exposure attacks on a new commitment scheme based on the Zagier polynomial
- Applications of signcryption
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Implicit related-key factorization problem on the RSA cryptosystem
- On the security of multi-prime RSA
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- A method for obtaining digital signatures and public-key cryptosystems
- scientific article; zbMATH DE number 1303120 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- Thrackles: an improved upper bound
- M mod 3 security of RSA
- Combined attack on CRT-RSA. Why public verification must not be public?
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Toward RSA-OAEP without random oracles
- Cryptanalysis of Prime Power RSA with two private exponents
- Cloud-assisted LLL: a secure and efficient outsourcing algorithm for approximate shortest vector problem
- Using LLL-reduction for solving RSA and factorization problems
- The geometry of provable security: some proofs of security in which lattices make a surprise appearance
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Computing prime divisors in an interval
- Small CRT-Exponent RSA Revisited
- Practical attacks on small private exponent RSA: new records and new insights
- Inferring sequences produced by the quadratic generator
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Instantiability of classical random-oracle-model encryption transforms
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- The multi-variable modular polynomial and its applications to cryptography
- HS-based error correction algorithm for noisy binary GCD side-channel sequences
- Finding small roots for bivariate polynomials over the ring of integers
- Improved Herrmann-May's attack with merging variables and lower LLL bound
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Generalized implicit factorization problem
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- Formalizing Coppersmith's method in Isabelle/HOL
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Smooth subsum search a heuristic for practical integer factorization
- Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
- A new generalized attack on RSA-like cryptosystems
- Solving multivariate Coppersmith problems with known moduli
- Solving modular linear equations via automated Coppersmith and its applications
- Generalized cryptanalysis of cubic Pell RSA
- A new generalized lattice attack against a family of RSA-like cryptosystems
- Fault attacks on multi-prime RSA signatures
- New results on elliptic curve hidden number problem for ECDH key exchange
- A generalized partial exposure lattice attack against an RSA variant based on cubic Pell curves
- Fully-homomorphic encryption from lattice isomorphism
- Distribution of powers modulo p and security of RSA
- Better bounds for finding fixed-degree isogenies via Coppersmith's method
- Implicit factorization with shared any bits
- Small public exponent brings more: improved partial key exposure attacks against RSA
This page was built for publication: Finding a small root of a univariate modular equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876895)
