Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
From MaRDI portal
Publication:3650710
DOI10.1007/978-3-642-10366-7_29zbMath1267.94065OpenAlexW2137602133MaRDI QIDQ3650710
Alexander May, Mathias Herrmann
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_29
Related Items
A Unified Framework for Small Secret Exponent Attack on RSA, Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization, Practical attacks on small private exponent RSA: new records and new insights, Partial key exposure attack on short secret exponent CRT-RSA, Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents, Predicting masked linear pseudorandom number generators over finite fields, Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound, Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption, Small CRT-Exponent RSA Revisited, Small CRT-exponent RSA revisited, Cryptanalysis of elliptic curve hidden number problem from PKC 2017, Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs, Forty years of attacks on the RSA cryptosystem: A brief survey
