PKC   2010 International Workshop on Public Key Cryptography
Wall of Fame | Most Viewed PKC-2010 Paper
234views Cryptology» more  PKC 2010»
13 years 8 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
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.
1Download preprint from source234
2Download preprint from source217
3Download preprint from source210
4Download preprint from source210
5Download preprint from source199
6Download preprint from source193
7Download preprint from source187
8Download preprint from source183
9Download preprint from source179
10Download preprint from source177
11Download preprint from source175
12Download preprint from source162
13Download preprint from source161
14Download preprint from source150
15Download preprint from source148
16Download preprint from source146
17Download preprint from source138
18Download preprint from source130
19Download preprint from source126
20Download preprint from source126
21Download preprint from source119
22Download preprint from source118