Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
From MaRDI portal
Publication:2876898
DOI10.1007/3-540-68339-9_16zbMath1304.94043OpenAlexW2147906334MaRDI QIDQ2876898
Publication date: 20 August 2014
Published in: Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-68339-9_16
Related Items
A Unified Framework for Small Secret Exponent Attack on RSA, Attacking RSA Using an Arbitrary Parameter, Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents, Inferring sequences produced by elliptic curve generators using Coppersmith's methods, A New Partial Key Exposure Attack on Multi-power RSA, Attacking the linear congruential generator on elliptic curves via lattice techniques, Practical attacks on small private exponent RSA: new records and new insights, \textit{Caveat implementor!} Key recovery attacks on MEGA, The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications, A bivariate polynomial-based cryptographic hard problem and its applications, Deterministic factoring with oracles, Inferring sequences produced by the quadratic generator, Improving bounds on elliptic curve hidden number problem for ECDH key exchange, Partial key exposure attack on short secret exponent CRT-RSA, A sharper lower bound on Rankin's constant, On the Improvement of the BDF Attack on LSBS-RSA, Algebraic Cryptanalysis of CTRU Cryptosystem, 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, Lattice attacks against elliptic-curve signatures with blinded scalar multiplication, Factorization, malleability and equivalent problems, Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents, Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting), A Tool Kit for Partial Key Exposure Attacks on RSA, Partial Bits Exposure Attacks on a New Commitment Scheme Based on the Zagier Polynomial, On the security of multi-prime RSA, Further improvement of factoring \(N=p^rq^s\) with partial known bits, Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions, Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound, Implicit Related-Key Factorization Problem on the RSA Cryptosystem, Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption, Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors, Combined Attack on CRT-RSA, Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA, Small CRT-Exponent RSA Revisited, Small CRT-exponent RSA revisited, Divisors in residue classes, constructively, Using LLL-Reduction for Solving RSA and Factorization Problems, Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits, Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem, A Simple and Improved Algorithm for Integer Factorization with Implicit Hints, Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents, A deterministic algorithm for integer factorization, Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures, Cryptanalysis of elliptic curve hidden number problem from PKC 2017, Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits, Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods, On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem, Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli, Simplified High-Speed High-Distance List Decoding for Alternant Codes, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, RSA key recovery from digit equivalence information, Formally verified certificate checkers for hardest-to-round computation
