Pages that link to "Item:Q2876898"
From MaRDI portal
The following pages link to Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known (Q2876898):
Displayed 50 items.
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- Further improvement of factoring \(N=p^rq^s\) with partial known bits (Q1726017) (← links)
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound (Q1727391) (← links)
- Coppersmith's lattices and ``focus groups'': an attack on small-exponent RSA (Q1998906) (← links)
- Small CRT-exponent RSA revisited (Q2010590) (← links)
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem (Q2025379) (← links)
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures (Q2040024) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- RSA key recovery from digit equivalence information (Q2096611) (← links)
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents (Q2170085) (← links)
- Inferring sequences produced by elliptic curve generators using Coppersmith's methods (Q2182710) (← links)
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents (Q2202020) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017 (Q2291665) (← links)
- Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting) (Q2693015) (← links)
- A Simple and Improved Algorithm for Integer Factorization with Implicit Hints (Q2790046) (← links)
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
- A deterministic algorithm for integer factorization (Q2796032) (← links)
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods (Q2817871) (← links)
- Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli (Q2829209) (← links)
- A Unified Framework for Small Secret Exponent Attack on RSA (Q2889876) (← links)
- A New Partial Key Exposure Attack on Multi-power RSA (Q2947151) (← links)
- A Tool Kit for Partial Key Exposure Attacks on RSA (Q2975796) (← links)
- Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial (Q2980866) (← links)
- Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption (Q3011906) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem (Q3297646) (← links)
- On the Improvement of the BDF Attack on LSBS-RSA (Q3511153) (← links)
- Algebraic Cryptanalysis of CTRU Cryptosystem (Q3511333) (← links)
- On the security of multi-prime RSA (Q3537519) (← links)
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
- Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors (Q4916008) (← links)
- Combined Attack on CRT-RSA (Q4916010) (← links)
- Attacking RSA Using an Arbitrary Parameter (Q5048985) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Divisors in residue classes, constructively (Q5429512) (← links)
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits (Q5502751) (← links)
- Small CRT-Exponent RSA Revisited (Q5738972) (← links)
- Practical attacks on small private exponent RSA: new records and new insights (Q6070359) (← links)
- \textit{Caveat implementor!} Key recovery attacks on MEGA (Q6083661) (← links)
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications (Q6091132) (← links)
- A bivariate polynomial-based cryptographic hard problem and its applications (Q6109708) (← links)
- Deterministic factoring with oracles (Q6115442) (← links)
- Inferring sequences produced by the quadratic generator (Q6134038) (← links)
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange (Q6135458) (← links)
- Partial key exposure attack on short secret exponent CRT-RSA (Q6157487) (← links)
- A sharper lower bound on Rankin's constant (Q6161436) (← links)
