搜索结果: 76-90 共查到“军事学 elliptic curves”相关记录150条 . 查询时间(0.219 秒)
A Family of Implementation-Friendly BN Elliptic Curves
pairing-based cryptography BN curves
2010/8/11
We describe a class of Barreto-Naehrig (BN) curves that are not only computationally very simple to generate, but also specially suitable for efficient implementation on the broadest possible range of...
Elliptic curves in Huff 's model
elliptic curve Huff curve isomorphism classes scalar multiplication
2010/7/14
This paper introduce generalizes the Huff curves $x(ay^2-1)=y(bx^2-1)$ which contains Huff's model $ax(y^2-1)=by(x^2-1)$ as a special case. It is shown that every elliptic curve over the finite field ...
Huff's Model for Elliptic Curves
Elliptic curves Huff's model unified addition law complete addition law explicit formulas scalar multiplication Tate pairing Miller algorithm
2010/7/14
This paper revisits a model for elliptic curves over Q introduced by Huff in 1948 to study a diophantine problem. Huff's model readily extends over fields of odd characteristic. Every elliptic curve o...
Co-Z Addition Formulae and Binary Ladders on Elliptic Curves
Elliptic curves Meloni’s technique Jacobian coordinates regular binary ladders
2010/7/13
Meloni recently introduced a new type of arithmetic on elliptic curves when adding projective points sharing the same Z-coordinate. This paper presents further co-Z addition formulae (and register all...
Combining leak--resistant arithmetic for elliptic curves defined over $\F_p$ and RNS representation
Elliptic curves Montgomery algorithm leak-resistance residue number system
2010/7/13
In this paper we combine the residue number system (RNS) representation and the leak-resistant arithmetic on elliptic curves. These two techniques are relevant for implementation of elliptic curve cry...
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
Static Diffie-Hellman problem elliptic curves
2010/4/7
We show that for any elliptic curve E(Fqn), if an adversary
has access to a Static Diffie-Hellman Problem (SDHP) oracle, then by
making O(q1− 1n+1 ) SDHP oracle queries during an initial learn...
Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves
Elliptic Curves Function Fields Hash Functions
2010/2/1
Let E be a non-supersingular elliptic curve over a finite field
Fq. At CRYPTO 2009, Icart [5] introduced a deterministic function Fq
E(Fq) which can be computed eciently, and allowed him and Coron
...
A mean value formula for elliptic curves
elliptic curves point multiplication division polynomial
2009/12/29
It is proved in this paper that for any point on an elliptic curve,
the mean value of x-coordinates of its n-division points is the same as
its x-coordinate.
FINDING COMPOSITE ORDER ORDINARY ELLIPTIC CURVES USING THE COCKS-PINCH METHOD
Cocks-Pinch method ordinary elliptic curves order setting
2009/11/18
We apply the Cocks-Pinch method to obtain pairing-friendly com-
posite order groups with prescribed embedding degree associated to ordinary
elliptic curves, and we show that new security issues aris...
Isogenies of Elliptic Curves:A Computational Approach
Isogenies Elliptic Curves Computational Approach
2009/11/18
The study of elliptic curves has historically been a subject of almost purely
mathematical interest. However, Koblitz and Miller independently showed that
elliptic curves can be used to implement cr...
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...
Fast Architectures for the T Pairing over Small-Characteristic Supersingular Elliptic Curves
Tate pairing T pairing elliptic curve FPGA
2009/8/18
This paper is devoted to the design of fast parallel
accelerators for the cryptographic T pairing on supersingular
elliptic curves over finite fields of characteristics two and three.
We propose h...
We provide the first construction of a hash function into an elliptic curve that is indiffer-
entiable from a random oracle. Our construction is quite efficient; it is based on Icart’s algorithm for
...
Multicore Implementation of the Tate Pairing over Supersingular Elliptic Curves
Tate pairing supersingular curve finite field arithmetic
2009/6/15
This paper describes the design of a fast multicore library
for the cryptographic Tate pairing over supersingular elliptic curves. We
report a calculation time of just 3:15 ms and 1:87 ms on the Int...
Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristics
Elliptic curves Hyperelliptic curves Non-hyperelliptic curves
2009/6/15
In this paper, we present a classification of classes of elliptic curves
defined over cubic extension of finite fields with odd characteristics, which
have coverings over the finite fields therefore...