On the optimality of lattices for the Coppersmith technique (Q1745898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00200-017-0336-9 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743602158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lattice Construction for Partial Key Exposure Attack for RSA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski Sum Based Lattice Construction for Multivariate Simultaneous Coppersmith’s Technique and Applications to RSA / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of Lattices for the Coppersmith Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of RSA with Private Key d Less than N 0.292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding smooth integers in short intervals using CRT decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Small Root of a Univariate Modular Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Simultaneous Modular Equations of Low Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Key Exposure Attacks on RSA up to Full Size Exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting Lattice Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free algorithms in positive characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LLL algorithm. Survey and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Lattice Points in a Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OAEP reconsidered / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Poisson distribution of lengths of lattice vectors in a random lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807117 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00200-017-0336-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:54, 11 December 2024

scientific article
Language Label Description Also known as
English
On the optimality of lattices for the Coppersmith technique
scientific article

    Statements

    On the optimality of lattices for the Coppersmith technique (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2018
    0 references
    Coppersmith technique
    0 references
    lattice construction
    0 references
    impossibility result
    0 references
    RSA cryptanalyses
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references