Sciweavers

Share
ANTS   2006 International Algorithmic Number Theory Symposium
Wall of Fame | Most Viewed ANTS-2006 Paper
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
11 years 9 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
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.
IdReadViewsTitleStatus
1Download preprint from source139
2Download preprint from source136
3Download preprint from source132
4Download preprint from source127
5Download preprint from source125
6Download preprint from source125
7Download preprint from source123
8Download preprint from source122
9Download preprint from source118
10Download preprint from source118
11Download preprint from source114
12Download preprint from source105
13Download preprint from source105
14Download preprint from source101
15Download preprint from source100
16Download preprint from source99
17Download preprint from source95
18Download preprint from source95
19Download preprint from source94
20Download preprint from source93
21Download preprint from source93
22Download preprint from source91
23Download preprint from source79
24Download preprint from source78
25Download preprint from source75
26Download preprint from source73
books