ANTS 2000 International Algorithmic Number Theory Symposium
 |  |
Wall of Fame | Most Viewed ANTS-2000 Paper
ANTS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 133 | ||
| 2 | | 117 | ||
| 3 | | 96 | ||
| 4 | | 94 | ||
| 5 | | 92 | ||
| 6 | | 87 |