Results 161 to 170 of about 1,830 (178)

Improved Implementations of Cryptosystems Based on Tate Pairing

2009
Hu et al . first studied pairing computations on supersingular elliptic curve with odd embedding degree k = 3 and applied them to Identity-based cryptosystems. In this paper, a careful analysis of the pairing computation on this family of supersingular curves is given.
Changan Zhao, Dongqing Xie, Fangguo Zhang, Chong-zhi Gao, Jingwei Zhang   +4 more
openaire   +1 more source

Implementation of the Extended Euclidean Algorithm for the Tate Pairing on FPGA

2004
The Tate pairing is a mapping which has good functionality for constructing elliptic cryptosystems, while its computation is a hard task. Especially, calculation of an inverse element using the extended Euclidean algorithm over a finite field \({\Bbb F}_p\) tends to be a bottleneck.
Takehiro Ito, Yuichiro Shibata, Kiyoshi Oguri   +2 more
openaire   +1 more source

Compression of Tate Pairings on Elliptic Curves

Journal of Software, 2007
In this paper, utilizing maps between cyclic groups contained in a finite field, two efficient methods for compressing a Tate pairing defined on a supersingular elliptic curve with prime characteristic p and MOV degree 3 are presented. They compress a pairing value from a string of length of 6logp bits to ones of 3logp and 2logp bits, respectively, and
openaire   +1 more source

Faster computation of Tate pairings

2009
This paper proposes new explicit formulas for the doubling and addition step in Miller’s algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric interpretation of the group law on Edwards curves by presenting the functions which arise in the addition and doubling.
Arène, C., Lange, T., Naehrig, M., Ritzenthaler, C.   +3 more
openaire   +1 more source

Tate Pairing with Strong Fault Resiliency

Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC 2007), 2007
Erdinç Öztürk, Gunnar Gaubatz, Berk Sunar   +2 more
openaire   +1 more source

Efficient Computations of the Tate Pairing for the Large MOV Degrees

Lecture Notes in Computer Science, 2003
Tetsuya Izu, Tsuyoshi Takagi, Izu Tetsuya   +2 more
exaly  

Tate Pairing Implementation for Hyperelliptic Curves y 2 = x p – x + d

Lecture Notes in Computer Science, 2003
Hyang-Sook Lee, Lee Hyang-Sook
exaly  

New formulae for Tate pairing computation on Weierstrass curves

Journal of China Universities of Posts and Telecommunications, 2013
Kunpeng Wang, Jun-De Song
exaly  

Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve

Journal of Systems Architecture, 2007
Michael Scott
exaly  

A generalisation of the Cassel-Tate pairing.

Journal für die reine und angewandte Mathematik (Crelles Journal), 1990
openaire   +1 more source