On the ideal shortest vector problem over random rational primes (Q2056701): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3158888163 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2004.10278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / 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: NTRU prime: reducing attack surface at low cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Generator in Cyclotomic Integer Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields / 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: Recovering Short Generators of Principal Ideals in Cyclotomic Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Stickelberger Class Relations and Application to Ideal-SVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortness of vectors to be found by the ideal-SVP quantum algorithm / 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: 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: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Compact Knapsacks Are Collision Resistant / 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: Number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness of ring-LWE for any ring and modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approx-SVP in ideal lattices with pre-processing / 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: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / 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

Latest revision as of 10:19, 27 July 2024

scientific article
Language Label Description Also known as
English
On the ideal shortest vector problem over random rational primes
scientific article

    Statements

    On the ideal shortest vector problem over random rational primes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2021
    0 references
    ring-LWE
    0 references
    ideal lattice
    0 references
    average case computational complexity
    0 references
    lattice-based cryptosystems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers