Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2796119287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Low Density Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving dense subset-sum problems by using analytical number theory / 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: A knapsack-type public key cryptosystem based on arithmetic in finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-density subset sum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting Lattice Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Enumeration Using Extreme Pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cryptographic schemes provably as secure as subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice points in high-dimensional spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hiding information and signatures in trapdoor knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting Density Attacks to Low-Weight Knapsacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5164805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lattice based cryptographic constructions / 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 polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem / 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

Latest revision as of 14:26, 23 July 2024

scientific article
Language Label Description Also known as
English
Improved broadcast attacks against subset sum problems via lattice oracle
scientific article

    Statements

    Improved broadcast attacks against subset sum problems via lattice oracle (English)
    0 references
    0 references
    0 references
    8 September 2020
    0 references
    subset sum problem
    0 references
    lattice-based cryptography
    0 references
    broadcast attack
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers