Solving Low Density Knapsacks (Q5019315): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme / 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: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345787 / rank
 
Normal rank

Latest revision as of 16:08, 27 July 2024

scientific article; zbMATH DE number 7453986
Language Label Description Also known as
English
Solving Low Density Knapsacks
scientific article; zbMATH DE number 7453986

    Statements

    Solving Low Density Knapsacks (English)
    0 references
    0 references
    8 January 2022
    0 references
    knapsack problem
    0 references
    modular mapping
    0 references
    basis reduction
    0 references
    short basis
    0 references

    Identifiers