搜索结果: 1-14 共查到“军事学 embedding degree”相关记录14条 . 查询时间(0.234 秒)
Optimal TNFS-secure pairings on elliptic curves with composite embedding degree
Optimal ate pairing twists of elliptic curves jacobian coordinates
2019/5/27
In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, considering different curve forms and twists where possible. We define a measure of the efficiency of a pa...
Optimal TNFS-secure pairings on elliptic curves with even embedding degree
TNFS-secure optimal pairing twisted Ate pairing
2018/11/6
In this paper we give a comprehensive comparison between pairing-friendly elliptic curves in Jacobi Quartic and Edwards form with quadratic, quartic, and sextic twists. Our comparison looks at the bes...
Optimal Ate Pairing on Elliptic Curves with Embedding Degree 9,15 and 27
Elliptic Curves Optimal Pairings Miller's algorithm
2017/1/3
Since the advent of pairing based cryptography, much attention has been given to efficient computation of pairings on elliptic curves with even embedding degrees. The few works that exist in the case ...
On Implementing Pairing-Based Protocols with Elliptic Curves of Embedding Degree One
public-key cryptography implement pairing-based protocols
2016/4/26
We observe that the conventional classification of pairings into Types 1, 2, 3 and 4 is not applicable to pairings from elliptic curves with embedding degree one. We define three kinds of pairings fro...
Self-pairings on supersingular elliptic curves with embedding degree $three$
Tate pairing Weil pairing
2014/3/10
Self-pairings are a special subclass of pairings and have interesting applications in cryptographic schemes and protocols. In this paper, we explore the computation of the self-pairings on supersingul...
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...
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...
Abelian varieties with prescribed embedding degree
Abelian varieties prescribed embedding degree
2009/6/2
We present an algorithm that, on input of a CM-field K, an
integer k 1, and a prime r 1 mod k, constructs a q-Weil number
2 OK corresponding to an ordinary, simple abelian variety A over
the f...
Ordinary abelian varieties having small embedding degree
Ordinary abelian varieties small embedding degree MNT
2009/4/3
Miyaji, Nakabayashi and Takano (MNT) gave families of
group orders of ordinary elliptic curves with embedding degree suitable
for pairing applications. In this paper we generalise their results by g...
Motivated by the needs of the pairing based cryptography, Miyaji,
Nakabayashi and Takano have suggested a construction of so-called
MNT elliptic curves with low embedding degree. We give some heuris...
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10
Pairing-Friendly Elliptic Curves Embedding Degree
2008/10/22
We present a general framew
ork for constructing families
of elliptic curves of prime order with prescribed embedding degree. We
demonstrate this method by constructing curves with embedding degree...
Families of genus 2 curves with small embedding degree
embedding degree genus 2 hyperelliptic curves binary curves pairing-based cryptography
2008/9/22
Hyperelliptic curves of small genus have the advantage of providing a
group of comparable size as that of elliptic curves, while working over a field of smaller
size. Pairing-friendly hyperelliptic ...
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
Jacobians hyperelliptic curves complex multiplication cryptography
2008/8/28
Consider the Jacobian of a genus two curve defined over a finite
field and with complex multiplication. In this paper we show that if the e-Sylow
subgroup of the Jacobian is not cyclic, then the emb...
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
Ate pairing Denominator elimination Final exponentiation
2008/5/22
For AES 128 security level there are several natural choices
for pairing-friendly elliptic curves. In particular, as we will explain, one
might choose curves with k = 9 or curves with k = 12. The ca...
