搜索结果: 106-120 共查到“军事学 elliptic curves”相关记录150条 . 查询时间(0.125 秒)
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...
Fast hashing onto elliptic curves over fields of characteristic 3
Fast hashing elliptic curves
2009/4/16
We describe a fast hash algorithm that maps arbitrary messages
onto points of an elliptic curve defined over a finite field of characteristic
3. Our new scheme runs in time O(m2) for curves over F3m...
Parallel Algorithm for Multiplication on Elliptic Curves
Parallel Algorithm Multiplication Elliptic Curves
2009/4/15
Given a positive integer n and a point P on an elliptic curve
E, the computation of nP, that is, the result of adding n times the point
P to itself, called the scalar multiplication, is the central ...
Constructing Elliptic Curves with Prescribed Embedding Degrees
Constructing Elliptic Curves Prescribed Embedding Degrees
2009/4/14
Pairing-based cryptosystems depend on the existence of
groups where the Decision Diffie-Hellman problem is easy to solve,
but the Computational Diffie-Hellman problem is hard. Such is the
case of e...
Parallel scalar multiplication on general elliptic curves over Fp hedged against Non-Di erential Side-Channel Attacks
Elliptic Curves Montgomery ladder Power Analysis
2009/4/13
For speeding up elliptic curve scalar multiplication and making
it secure against side-channel attacks such as timing or power analysis,
various methods have been proposed using specifically chosen ...
ID-based Signatures from Pairings on Elliptic Curves
ID-based Signatures Pairings Elliptic Curves
2009/4/13
ID-based Signatures from Pairings on Elliptic Curves.
A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves
parallelized Pollard lambda elliptic curves prime finite fields binary elliptic curves
2009/4/9
Let E be an elliptic curve defined over a prime finite field Fp by a
Weierstrass equation. In this paper we introduce a new partition of E(Fp)
into classes which are generally larger than f§Rg. We g...
Elliptic curves suitable for pairing based cryptography
Elliptic curves pairing cryptography
2009/4/9
Elliptic curves suitable for pairing based cryptography.
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
hyperelliptic curves explicit formulae comparison HECC vs. ECC
2009/4/8
For most of the time since they were proposed, it was widely believed that hyperelliptic curve
cryptosystems (HECC) carry a substantial performance penalty compared to elliptic curve cryptosystems (E...
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
random reducibility discrete log elliptic curves
2009/4/1
Cryptographic applications using an elliptic curve over a finite field
filter curves for suitability using their order as the primary criterion:
e.g. checking that their order has a large prime divi...
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 their seminal paper, Miyaji, Nakabayashi and Takano [12]
describe a simple method for the creation of elliptic curves of prime order
with embedding degree 3, 4, or 6. Such curves are important fo...
Summation polynomials and the discrete logarithm problem on elliptic curves
elliptic curves summation polynomials the discrete logarithm problem
2009/3/23
The aim of the paper is the construction of the index calculus algorithm
for the discrete logarithm problem on elliptic curves. The construction
presented here is based on the problem of finding bou...
Efficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics
generalized non-adjacent form (GNAF) radix-r non-adjacent form (rNAF) Frobenius-adic expansions Elliptic Curve Cryptosystems (ECC)
2009/3/19
In elliptic curve cryptosystems, scalar multiplications performed
on the curves have much effect on the efficiency of the schemes,
and many efficient methods have been proposed. In particular, recod...
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...