Revisiting lower dimension lattice attacks on NTRU (Q2681396): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2022.106353 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4313650487 / 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: Q3718617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Public-Key Cryptography in Hardware / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subfield Lattice Attack on Overstretched NTRU Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the shortest vector problem in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the expected cost of solving uSVP and applications to LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refined analysis of the cost for solving LWE via uSVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the success probability of solving unique SVP via BKZ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients / rank
 
Normal rank

Latest revision as of 11:32, 31 July 2024

scientific article
Language Label Description Also known as
English
Revisiting lower dimension lattice attacks on NTRU
scientific article

    Statements

    Revisiting lower dimension lattice attacks on NTRU (English)
    0 references
    0 references
    0 references
    3 February 2023
    0 references
    0 references
    lattice attack
    0 references
    key-recovery attack
    0 references
    NTRU
    0 references
    short vector
    0 references
    cryptography
    0 references
    0 references