NTRU Fatigue: How Stretched is Overstretched? (Q6045070): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Subfield Lattice Attack on Overstretched NTRU Assumptions / 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: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Generator in Cyclotomic Integer Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring, simulating and exploiting the head concavity phenomenon in BKZ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Short Generators of Principal Ideals in Cyclotomic Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaTRU: A New NTRU-Based Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: BKZ 2.0: Better Lattice Security Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: LWE with side information: attacks and concrete security estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5326926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantum algorithm for computing the unit group of an arbitrary degree number field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate Multilinear Maps from Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic encryption for finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Lattice Attacks on Overstretched NTRU Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787203 / 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: Quantum Computation and Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Public Key Encryption Based on Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order statistical behavior of LLL and BKZ / rank
 
Normal rank

Latest revision as of 05:07, 1 August 2024

scientific article; zbMATH DE number 7689407
Language Label Description Also known as
English
NTRU Fatigue: How Stretched is Overstretched?
scientific article; zbMATH DE number 7689407

    Statements

    NTRU Fatigue: How Stretched is Overstretched? (English)
    0 references
    0 references
    26 May 2023
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers