| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874129 | Information Processing Letters | 2018 | 12 Pages |
Abstract
We present a (probabilistic) birthday type attack to Naccache-Stern knapsack cryptosystem. We provide the space and time complexity of this attack alongside with the success probability. Furthermore, we applied successfully the attack for messages of low or large Hamming weight.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
M. Anastasiadis, N. Chatzis, K.A. Draziotis,