A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(6 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: fpLLL / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:19, 19 March 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
9 November 2022
0 references
Nguyen-Stern algorithm
0 references
lattice based algorithm
0 references