搜索结果: 91-105 共查到“军事学 E-Multiplication”相关记录126条 . 查询时间(0.125 秒)
Setting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication
Elliptic curve cryptosystem scalar multiplication multibase nonadjacent form
2009/6/3
In this paper, we introduce the Fractional Window-w Multibase Non-
Adjacent Form (Frac-wmbNAF) method to perform the scalar multiplication. This
method generalizes the recently developed Window-w mb...
Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields
Scalar Multiplication Elliptic Curve Cryptosystems Prime Fields
2009/6/3
Elliptic curve cryptography (ECC), independently introduced by Koblitz and Miller in the
80’s, has attracted increasing attention in recent years due to its shorter key length
requirement in compari...
High Performance Architecture for Elliptic Curve Scalar Multiplication over GF(2m)
Elliptic Curve Cryptography Elliptic Curve Scalar Multiplication FPGA
2009/6/2
We propose a new architecture for performing Elliptic Curve Scalar Multiplication (ECSM) on elliptic curves over
GF(2m). This architecture maximizes the parallelism that the projective version of the...
New Multibase Non-Adjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems（extended version）
Scalar multiplication multibase representation multibase non-adjacent form
2009/6/2
In this paper we present a new method for scalar multiplication that uses a generic
multibase representation to reduce the number of required operations. Further, a multibase NAF-like
algorithm that...
NON-CYCLIC SUBGROUPS OF JACOBIANS OF GENUS TWO CURVES WITH COMPLEX MULTIPLICATION
Jacobians hyperelliptic curves embedding degree complex multiplication
2009/6/2
Let E be an elliptic curve de ned over a nite eld. Balasubramanian
and Koblitz have proved that if the `th roots of unity ` is not contained
in the ground eld, then a eld extension of the groun...
The computation speed of pairing based cryptosystems is
slow compared with the other public key cryptosystems even though
several efficient computation algorithms have been proposed. Thus more
effi...
Analysis and optimization of elliptic-curve single-scalar multiplication
optimization elliptic-curve single-scalar multiplication I/M ratio
2009/6/2
Let P be a point on an elliptic curve over a finite field of large
characteristic. Exactly how many points 2P, 3P, 5P, 7P, 9P, . . . ,mP should be
precomputed in a sliding-window computation of nP? ...
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 ...
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 ...
Elliptic Curve Point Multiplication
cryptography elliptic curves complex multiplication fast algorithms
2009/4/9
New type of elliptic curve point multiplication is proposed, where complex multiplication by 2− or by 2)71(−± is used instead of point duplication. This allows speeding up multiplication a...
Parallel Montgomery Multiplication in GF(2k) using Trinomial Residue Arithmetic
Finite field arithmetic Montgomery multiplication Polynomial residue arithmetic
2009/3/31
We propose the first general multiplication algorithm in GF(2k) with a subquadratic area
complexity of O(k8/5) = O(k1.6). Using the Chinese Remainder Theorem, we represent the
elements of GF(2k); i....
A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods
Minimal Average Weight Representation Left-to-Right Point Multiplication Methods
2009/3/31
A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods.
Long Modular Multiplication for Cryptographic Applications
Computer Arithmetic Cryptography Modular multiplication
2009/3/27
A digit-serial, multiplier-accumulator based cryptographic co-processor architecture is proposed, similar to fix-point DSP's with enhance-ments, supporting long modular arithmetic and general computat...
Two Software Normal Basis Multiplication Algorithms for GF(2n)
Finite field normal basis multiplication algorithm
2009/3/27
In this paper, two different normal basis multiplication algorithms for software
implementation are proposed over GF(2n). The first algorithm is suitable for high complexity
normal bases and the sec...
Efficient Scalar Multiplication by Isogeny Decompositions
Elliptic curve cryptography fast arithmetic efficiently computable isogenies
2009/3/17
On an elliptic curve, the degree of an isogeny corresponds essentially
to the degrees of the polynomial expressions involved in its application.
The multiplicationby` map [`] has degree `2, theref...