搜索结果: 1-4 共查到“Tate pairing computation”相关记录4条 . 查询时间(0.072 秒)
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
supersingular elliptic curve Tate pairing divisor
2009/4/1
After Miller's original algorithm for the Tate pairing computation, many improved
algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al.,
especially for the field...
Powered Tate pairing computation
Powered Tate pairing Tate pairing Bilinear map Elliptic Curve Cryptosystem
2009/2/23
In this paper, we introduce a powered Tate pairing on a supersingular elliptic
curve that has the same shortened loop as the modified Tate pairing using the eta pairing
approach by Barreto et al. Th...
Tate pairing computation on the divisors of hyperelliptic curves for cryptosystems
Tate pairing computation hyperelliptic curve cryptosystems pairing-based cryptosystems
2009/2/10
In recent papers [4] and [9], Barreto et al and Choie et al
worked on hyperelliptic curves Hb defined by y2 + y = x5 + x3 + b over
a finite field F2n with b = 0 or 1 for a secure and efficient pairi...
Efficient Tate Pairing Computation Using Double-Base Chains
Tate pairing Elliptic curves Double-base chains
2008/11/28
Pairing-based cryptosystems have been developing very fast
in the last few years. The efficiencies of the cryptosystems are determined
by the computation of the Tate pairing. In this paper a new eff...