Comments on the iterated knapsack attack
Conference
·
OSTI ID:5722902
L. Adleman has proposed a three step method for breaking the iterated knapsack that runs in polynomial time and is linear in the number of iterations. In this paper, we show that the first step is possibly exponential in the number of iterations, and that the second and third steps are exponential even for only three iterations.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (USA)
- DOE Contract Number:
- AC04-76DP00789
- OSTI ID:
- 5722902
- Report Number(s):
- SAND-83-1538C; CONF-830831-2; ON: DE83016762
- Resource Relation:
- Conference: CRYPTO '83 conference, Santa Barbara, CA, USA, 21 Aug 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
Status report on knapsack-based public key cryptosystems
Are most low-density knapsacks solvable in polynomial time
A parallel algorithm for the knapsack problem
Technical Report
·
Tue Feb 01 00:00:00 EST 1983
·
OSTI ID:5722902
Are most low-density knapsacks solvable in polynomial time
Conference
·
Sat Jan 01 00:00:00 EST 1983
·
OSTI ID:5722902
A parallel algorithm for the knapsack problem
Journal Article
·
Tue May 01 00:00:00 EDT 1984
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5722902