On the optimality of lattices for the Coppersmith technique
type: Item
instance of: scholarly article
title: On the optimality of lattices for the Coppersmith technique
zbMATH Open document ID: 1401.94136
author: Yoshinori Aono
author: Manindra Agrawal
author: Takakazu Satoh
author: Osamu Watanabe
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2018-04-18T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6861454
zbMATH Keywords: Coppersmith technique
zbMATH Keywords: lattice construction
zbMATH Keywords: impossibility result
zbMATH Keywords: RSA cryptanalyses
MaRDI profile type: Publication
OpenAlex ID: W2743602158
cites work: A New Lattice Construction for Partial Key Exposure Attack for RSA
cites work: Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA
cites work: On the Optimality of Lattices for the Coppersmith Technique
cites work: Cryptanalysis of RSA with Private Key d Less than N 0.292
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Finding smooth integers in short intervals using CRT decoding
cites work: Finding a Small Root of a Univariate Modular Equation
cites work: Q4787196
cites work: Solving Simultaneous Modular Equations of Low Degree
cites work: Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
cites work: Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials
cites work: Partial Key Exposure Attacks on RSA up to Full Size Exponents
cites work: Predicting Lattice Reduction
cites work: Square-free algorithms in positive characteristic
cites work: Q4400575
cites work: Q4787198
cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
cites work: On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree
cites work: On polynomial congruences
cites work: Factoring polynomials with rational coefficients
cites work: Q3871006
cites work: The LLL algorithm. Survey and applications
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: The Number of Lattice Points in a Set
cites work: Q3999269
cites work: OAEP reconsidered
cites work: On the Poisson distribution of lengths of lattice vectors in a random lattice
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Q3807117
DOI: 10.1007/S00200-017-0336-9
description: scientific article; zbMATH DE number 6861454