A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
From MaRDI portal
Publication:5385733
DOI10.1007/11426639_15zbMath1137.11359OpenAlexW1562208741MaRDI QIDQ5385733
Johannes Blömer, Alexander May
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11426639_15
Related Items
Toward RSA-OAEP Without Random Oracles, Recovering zeros of polynomials modulo a prime, Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents, Reconstructing points of superelliptic curves over a prime finite field, Deterministic factoring with oracles, Inferring sequences produced by the quadratic generator, Instantiability of classical random-oracle-model encryption transforms, Improved cryptanalysis of the multi-power RSA cryptosystem variant, A Tool Kit for Partial Key Exposure Attacks on RSA, Combined Attack on CRT-RSA, Using LLL-Reduction for Solving RSA and Factorization Problems