搜索结果: 1-12 共查到“军队指挥学 pairing-friendly elliptic curves”相关记录12条 . 查询时间(0.499 秒)
TNFS Resistant Families of Pairing-Friendly Elliptic Curves
Pairings elliptic curves pairing-friendly parameters
2018/11/2
Recently there has been a significant progress on the tower number field sieve (TNFS) method, reducing the complexity of the discrete logarithm problem (DLP) in finite field extensions of composite de...
A New Family of Pairing-Friendly elliptic curves
Pairing-Friendly elliptic curves large characteristic
2018/3/5
There have been recent advances in solving the finite extension field discrete logarithm problem as it arises in the context of pairing-friendly elliptic curves. This has lead to the abandonment of ap...
A NEW METHOD OF CHOOSING PRIMITIVE ELEMENTS FOR BREZING-WENG FAMILIES OF PAIRING FRIENDLY ELLIPTIC CURVES
public-key cryptography / elliptic curves finite fields pairing-based cryptography
2013/4/18
In this paper we present a new method of choosing primitive elements for Brezing-Weng families of pairing friendly elliptic curves with small rho-value, and we improve on previously-known best rho-val...
Pairing-Friendly Elliptic Curves With Various Discriminants
pairing-friendly elliptic curves embedding degree elliptic curves
2009/8/25
In this paper, we extend the Brezing-Weng method by parameterizing the
discriminant D by a polynomial D(x) and give a construction of families of pairingfriendly
elliptic curves with various discrim...
Factoring Polynomials for Constructing Pairing-friendly Elliptic Curves
Factoring Polynomials Pairing-friendly Elliptic Curves
2009/6/2
In this paper we present a new method to construct a polynomial u(x) 2
Z[x] which will make k(u(x)) reducible. We construct a finite separable
extension of Q(k), denoted as E. By primitive element...
Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field
Brezing-Weng pairing elliptic curves cyclotomic field
2009/6/2
We describe a new method for constructing Brezing-Weng-
like pairing-friendly elliptic curves. The new construction uses the min-
imal polynomials of elements in a cyclotomic ¯eld. Using this n...
Effective Polynomial Families for Generating More Pairing-Friendly Elliptic Curves
elliptic curves over extension field effective polynomial family non-supersingular elliptic curves
2009/2/19
Finding suitable non-supersingular elliptic curves becomes an important issue for the
growing area of pairing-based cryptosystems. For this purpose, many methods have
been proposed when embedding de...
Pairing-Friendly Elliptic Curves of Prime Order
elliptic curves pairing-based cryptosystems
2009/2/6
Previously known techniques to construct pairing-friendly
curves of prime or near-prime order are restricted to embedding degree
k 6 6. More general methods produce curves over Fp where the
bit len...
Pairing-friendly elliptic curves with small security loss by Cheon’s algorithm
Pairing based cryptosystem Elliptic curves Weil pairing
2009/1/4
Pairing based cryptography is a new public key cryptographic
scheme. An elliptic curve suitable for pairing based cryptography is called
a “pairing-friendly” elliptic curve. After Mitsunari, Sakai a...
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...
Construction of Pairing-Friendly Elliptic Curves
Construction Pairing-Friendly Elliptic Curves
2008/9/8
The aim of this paper is to construct pairing friendly elliptic curves.
Constructing Brezing-Weng pairing friendly elliptic curves using elements in the cyclotomic field
elliptic curves cyclotomic field
2008/5/21
We describe a new method for constructing Brezing-Weng-
like pairing-friendly elliptic curves. The new construction uses the min-
imal polynomials of elements in a cyclotomic ¯eld. Using this n...