A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SageMath / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BKZ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3021630508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for solving the hidden subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-density subset sum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Multilinear Maps over the Integers / 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: Cryptanalysis of CLT13 multilinear maps with independent slots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Attacks Against emv Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Kilian's randomization of multilinear map encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of the Co-ACD Assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LLL Algorithm with Quadratic Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / 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: Fully Homomorphic Encryption over the Integers / rank
 
Normal rank

Latest revision as of 19:35, 30 July 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for solving the hidden subset sum problem
scientific article

    Statements

    A polynomial-time algorithm for solving the hidden subset sum problem (English)
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    0 references
    Nguyen-Stern algorithm
    0 references
    lattice based algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references