scientific article; zbMATH DE number 1302812

From MaRDI portal
Revision as of 16:30, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4249286

zbMath0956.94007MaRDI QIDQ4249286

Yair Frankel, Dan Boneh, Glenn Durfee

Publication date: 17 June 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (38)

On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSAAttacking RSA with a Composed Decryption Exponent Using Unravelled LinearizationGeneralizing statistical ineffective fault attacks in the spirit of side-channel attacksClassical attacks on a variant of the RSA cryptosystemFactoring RSA moduli with primes sharing bits in the middleApproximate divisor multiples -- factoring with only a third of the secret CRT-exponentsPartial Key Exposure Attack on CRT-RSAA New Partial Key Exposure Attack on Multi-power RSACryptanalytic results on `Dual CRT' and `Common Prime' RSAPartial key exposure attacks on BIKE, Rainbow and NTRUContinued fractions applied to a family of RSA-like cryptosystemsFurther cryptanalysis of a type of RSA variantsBreaking Goppa-based McEliece with hintsDecoding McEliece with a hint -- secret Goppa key parts reveal everythingOn the Improvement of the BDF Attack on LSBS-RSAA third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blindingExtended partial key exposure attacks on RSA: improvement up to full size decryption exponentsA Tool Kit for Partial Key Exposure Attacks on RSALarge decryption exponents in RSAPartial key exposure attacks on RSA: achieving the Boneh-Durfee boundImplicit Related-Key Factorization Problem on the RSA CryptosystemRecovering RSA Secret Keys from Noisy Key Bits with Erasures and ErrorsOn the security of RSA with primes sharing least-significant bitsOn the number of sparse RSA exponentsDivisors in residue classes, constructivelyCryptanalysis of RSA for a special case with \(d > e\)Using LLL-Reduction for Solving RSA and Factorization ProblemsFinding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystemPartial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption ExponentsImproved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime FactorsIdeal forms of Coppersmith's theorem and Guruswami-Sudan list decodingPartial Key Exposure Attacks on RSA with Multiple Exponent PairsDistinguishing Multiplications from Squaring OperationsPartial Key Exposure: Generalized Framework to Attack RSACryptanalysis of Short Exponent RSA with Primes Sharing Least Significant BitsImproved reconstruction of RSA private-keys from their fractionRevisiting prime power RSAForty years of attacks on the RSA cryptosystem: A brief survey




This page was built for publication: