Sciweavers

11 search results - page 3 / 3
» Multi-core Implementation of the Tate Pairing over Supersing...
Sort
View
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 6 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...