搜索结果: 1-15 共查到“Pairing computation”相关记录22条 . 查询时间(0.115 秒)
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
NFS optimal ate pairing computation
2019/4/28
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situ...
Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction
Verifiable and secure delegation bilinear maps cryptographic protocols
2017/12/6
We address the problem of secure and verifiable delegation of general pairing computation. We first analyze some recently proposed pairing delegation schemes and present several attacks on their secur...
Speeding up Ate Pairing Computation in Affine Coordinates
Ate pairing Pairing computation final exponentiation
2013/4/18
At Pairing 2010, Lauter et al's analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, we further inv...
RNS arithmetic in F_{p^k and application to fast pairing computation
RNS arithmetic fast pairing computation
2010/11/2
In this work, we are interested in arithmetic in large prime field and their extensions of small degree. We explain why it is very interesting to use RNS arithmetic for the base field ${\mathbb F}_p$ ...
Pairing Computation on Elliptic Curves of Jacobi Quartic Form
elliptic curve pairing geometric interpretation
2010/9/9
This paper proposes explicit formulae for the addition step and doubling step in Miller's algorithm to compute Tate pairing on Jacobi quartic curves. We present a geometric interpretation of the group...
Pairing computation on curves with efficiently computable endomorphism and small embedding degree
elliptic curves pairings isogenies
2010/7/14
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He pointed out that pairing implementation becomes th...
An Analysis of Affine Coordinates for Pairing Computation
implementation Pairing computation Miller's algorithm affine coordinates optimal ate pairing finite field inversions pairing cost multiple pairings pairing products
2010/7/14
In this paper we analyze the use of affine coordinates for pairing computation. We observe that in many practical settings, for example when implementing optimal ate pairings in high security levels, ...
A study of pairing computation for curves with embedding degree 15
Pairing based cryptography Pairing computation Arithmetic Interpolation
2009/8/7
This paper presents the first study of pairing computation on curves with embedding
degree 15. We compute the Ate and the twisted Ate pairing for a family of curves with parameter
1.5 and embeddin...
Another approach to pairing computation in Edwards coordinates
Tate pairing Miller’s algorithm Edwards coordinates
2009/6/5
The recent introduction of Edwards curves has significantly
reduced the cost of addition on elliptic curves. This paper presents new
explicit formulae for pairing implementation in Edwards coordinat...
Reducing the Complexity of the Weil Pairing Computation
Weil pairing ate pairing elliptic curves
2009/6/4
In this paper, we investigate to compute the variants based
on the Weil pairing with short Miller iteration loops.
A Pipelined Karatsuba-Ofman Multiplier over GF(397)Amenable for Pairing Computation
Finite field arithmetic Field Multiplier cryptography
2009/6/3
We present a subquadratic ternary field multiplier based on the combination
of several variants of the Karatsuba-Ofman scheme recently published.
Since one of the most relevant applications for this...
Efficient and Generalized Pairing Computation on Abelian Varieties
pairing elliptic curves hyperelliptic curves
2009/6/2
In this paper, we propose a new method for constructing a bilinear pairing over
(hyper)elliptic curves, which we call the R-ate pairing. This pairing is a generalization
of the Ate and Atei pairing,...
Efficient Pairing Computation on Supersingular Abelian Varieties
Tate pairing supersingular curves pairing-based cryptosystems
2009/4/3
We present a general technique for the efficient computation of pairings
on supersingular Abelian varieties. This formulation, which we call the eta
pairing, generalises results of Duursma and Lee f...
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...
In this note, we describe how to achieve a simple yet substantial speed
up of Miller’s algorithm, when not using denominator elimination, and working
over quadratic extension fields.