Faster algorithm for solving hard knapsacks for moderate message length (Q2907361)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6079540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithm for solving hard knapsacks for moderate message length |
scientific article; zbMATH DE number 6079540 |
Statements
Faster Algorithm for Solving Hard Knapsacks for Moderate Message Length (English)
0 references
7 September 2012
0 references
knapsack cryptosystem
0 references
subset sum problem
0 references
hard knapsacks
0 references
0.8729259967803955
0 references
0.8686473369598389
0 references
0.7918791174888611
0 references
0.7870453000068665
0 references
