Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
type: Item
instance of: scholarly article
title: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
zbMATH Open document ID: 1421.94072
author: Atsushi Takayasu
author: Noboru Kunihiro
published in: Theoretical Computer Science
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7026784
zbMATH Keywords: RSA
zbMATH Keywords: partial key exposure
zbMATH Keywords: lattices
zbMATH Keywords: Coppersmith's method
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.08.021
OpenAlex ID: W2889437918
cites work: Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
cites work: Cryptanalysis of short RSA secret exponents
cites work: Cryptanalysis of RSA with private key d less than N/sup 0.292/
cites work: Finding a Small Root of a Univariate Modular Equation
cites work: Q4249286
cites work: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Partial Key Exposure Attacks on RSA up to Full Size Exponents
cites work: A New Lattice Construction for Partial Key Exposure Attack for RSA
cites work: Partial Key Exposure Attack on RSA – Improvements for Limited Lattice Dimensions
cites work: Factoring polynomials with rational coefficients
cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
cites work: Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
cites work: Q2707398
cites work: Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
cites work: Revisiting prime power RSA
cites work: Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
cites work: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
cites work: Inferring Sequences Produced by Nonlinear Pseudorandom Number Generators Using Coppersmith’s Methods
cites work: Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
cites work: On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree
cites work: Cryptanalysis of RSA with Multiple Small Secret Exponents
cites work: How to Generalize RSA Cryptanalyses
cites work: Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
cites work: A Tool Kit for Partial Key Exposure Attacks on RSA
cites work: Solving Linear Equations Modulo Unknown Divisors: Revisited
cites work: Small Secret Key Attack on a Variant of RSA (Due to Takagi)
cites work: On the security of multi-prime RSA
cites work: On the optimality of lattices for the Coppersmith technique
cites work: Small CRT-Exponent RSA Revisited
cites work: Applied cryptography and network security. 7th international conference, ACNS 2009, Paris-Rocquencourt, France, June 2--5, 2009. Proceedings
cites work: New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
cites work: Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
cites work: Partial key exposure attacks on CRT-RSA: general improvement for the exposed least significant bits
cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities
cites work: Q4787196
cites work: Using LLL-Reduction for Solving RSA and Factorization Problems
cites work: Q4787205
cites work: Q4400575
Wikidata QID: Q129331854
DOI: 10.1016/J.TCS.2018.08.021
description: scientific article; zbMATH DE number 7026784