搜索结果: 1-15 共查到“军事学 Pairing-friendly”相关记录30条 . 查询时间(0.078 秒)
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...
Pairing-Friendly Twisted Hessian Curves
twisted Hessian curves pairing-friendly curves ate pairing
2018/11/2
This paper presents efficient formulas to compute Miller doubling and Miller addition utilizing degree-3 twists on curves with j-invariant 0 written in Hessian form. We give the formulas for both odd...
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...
Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
cryptographic protocols zero-knowledge proofs
2016/1/3
Since their introduction in 1985, by Goldwasser, Micali and Rackoff, followed by Feige, Fiat
and Shamir, zero-knowledge proofs have played a significant role in modern cryptography: they allow a
par...
The Special Number Field Sieve in $\F _{p^{n}}$, Application to Pairing-Friendly Constructions
Discrete logarithms SNFS
2014/3/10
In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise analysis of the state-of-the-art algorithms for computing discrete loga...
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...
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
public-key cryptography / Hyperelliptic Curves Genus 2 Order Computation
2012/6/14
The use of (hyper)elliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test wheth...
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
public-key cryptography / Hyperelliptic Curves Genus 2 Order Computation Ordinary Curves Pairing-Friendly Constructions Cocks-Pinch Method Brezing-Weng Method.
2012/3/22
The use of (hyper)elliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test wheth...
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
public-key cryptography / Hyperelliptic Curves Genus 2 Order Computation Ordinary Curves Pairing-Friendly Constructions Cocks-Pinch Method Brezing-Weng Method.
2012/3/21
The use of (hyper)elliptic curves in cryptography relies on the ability to compute the Jacobian order of a given curve. Recently, Satoh proposed a probabilistic polynomial time algorithm to test wheth...
Generating Pairing-friendly Parameters for the CM Construction of Genus 2 Curves over Prime Fields
hyperelliptic curve cryprography pairing-friendly parameters
2010/10/20
We present two contributions in this paper. First, we give a quantitative analysis of the scarcity of pairing-friendly genus 2 curves, assuming the Riemann Hypothesis. This result is an improvement re...
Generating more Kawazoe-Takahashi Genus 2 Pairing-friendly Hyperelliptic Curves
pairing-friendly curves hyperelliptic curves pairings
2010/7/14
Constructing pairing-friendly hyperelliptic curves with small $\rho$-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe a method that e...
Barreto-Naehrig Curve With Fixed Coefficient——Efficiently Constructing Pairing-Friendly Curves
Barreto-Naehrig Curve Fixed Coefficient Pairing-Friendly Curves
2010/3/16
This paper describes a method for constructing Barreto-
Naehrig (BN) curves and twists of BN curves that are pairing-friendly
and have the embedding degree 12 by using just primality tests without
...
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...
When using pairing-friendly ordinary elliptic curves over
prime fields to implement identity-based protocols, there is often a need
to hash identities to points on one or both of the two elliptic cu...
On the security of pairing-friendly abelian varieties over non-prime fields
pairing-friendly abelian non-prime fields pairing-based cryptosystem
2009/6/9
Let A be an abelian variety defined over a non-prime finite
field Fq that has embedding degree k with respect to a subgroup of prime
order r. In this paper we give explicit conditions on q, k, and r...