Advances in Cryptology - EUROCRYPT 2004
From MaRDI portal
Publication:5307271
DOI10.1007/b97182zbMath1122.13302OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307271
Publication date: 25 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97182
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Numerical computation of solutions to single equations (65H05) Polynomials, factorization in commutative rings (13P05) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Trapdoor DDH groups from pairings and isogenies, A note on the bivariate Coppersmith theorem, Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices, Fast rebalanced RSA signature scheme with typical prime generation, A New Partial Key Exposure Attack on Multi-power RSA, Attacking the linear congruential generator on elliptic curves via lattice techniques, Deterministic factoring with oracles, On the Improvement of the BDF Attack on LSBS-RSA, A Tool Kit for Partial Key Exposure Attacks on RSA, Implicit Related-Key Factorization Problem on the RSA Cryptosystem, Small CRT-Exponent RSA Revisited, Small CRT-exponent RSA revisited, Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem, Cryptanalysis of RSA with two decryption exponents, Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents, Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures, RSA Moduli with a Predetermined Portion: Techniques and Applications, Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, Forty years of attacks on the RSA cryptosystem: A brief survey