Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311534
DOI10.1007/b99099zbMath1104.94030OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311534
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99099
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)
Related Items (8)
Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents ⋮ Fast rebalanced RSA signature scheme with typical prime generation ⋮ Partial key exposure attack on short secret exponent CRT-RSA ⋮ Signcryption Schemes Based on the RSA Problem ⋮ 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 ⋮ Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
Uses Software
This page was built for publication: Advances in Cryptology – CRYPTO 2004
