搜索结果: 1-12 共查到“密码学 double-base”相关记录12条 . 查询时间(0.14 秒)
This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper's multiply-by-n algorithm takes ...
On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
Double-base number system elliptic curve cryptography
2016/1/9
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A Double-Base Chain (DBC) is a special case of a DBNS expansion. DBCs have been introduced to speed u...
VLSI Implementation of Double-Base Scalar Multiplication on a Twisted Edwards Curve with an Efficiently Computable Endomorphism
Multiple-precision arithmetic Pseudo-Mersenne prime
2015/12/30
The verification of an ECDSA signature requires a double-base scalar multiplication, an operation of the form k⋅G+l⋅Q where G is a generator of a large elliptic curve group of prime order ...
Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains
Elliptic Cruve Cryptography Minimal Weight Conversion Digit Set Expansion Double-Base Chains
2011/1/20
In this work, we propose an algorithm to produce the double-base chains that optimize the time used for computing an elliptic curve cryptosystem. The double-base chains is the representation that comb...
Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains
implementation / Elliptic Cruve Cryptography Minimal Weight Conversion Digit Set Expansion Double-Base Chains
2012/3/30
In this work, we propose an algorithm to produce the double-base chains that optimize the time used for computing an elliptic curve cryptosystem. The double-base chains is the representation that comb...
Double-Base Number System for Multi-Scalar Multiplications
Elliptic curve cryptography scalar multiplication Double-Base Number System
2009/6/9
The Joint Sparse Form is currently the standard representation
system to perform multi-scalar multiplications of the form [n]P +
m[Q]. We introduce the concept of Joint Double-Base Chain, a generali...
Fast Multiple Point Multiplication on Elliptic Curves over Prime and Binary Fields using the Double-Base Number System
Fast Multiple Point Multiplication Elliptic Curves Prime and Binary Fields Double-Base Number System
2009/6/3
Multiple-point multiplication on elliptic curves is
the highest computational complex operation in the elliptic curve
cyptographic based digital signature schemes. We describe three
algorithms for ...
Fast Elliptic Curve Point Multiplication using Double-Base Chains
Elliptic curve cryptography scalar multiplication double-base number system
2009/1/20
Among the various arithmetic operations required in implementing public key cryptographic
algorithms, the elliptic curve point multiplication has probably received the maximum attention
from the res...
Extended Double-Base Number System with applications to Elliptic Curve Cryptography
Double-Base Number System applications Elliptic Curve Cryptography
2008/12/19
Extended Double-Base Number System with applications to Elliptic Curve Cryptography.
Efficient Tate Pairing Computation Using Double-Base Chains
Tate pairing Elliptic curves Double-base chains
2008/11/28
Pairing-based cryptosystems have been developing very fast
in the last few years. The efficiencies of the cryptosystems are determined
by the computation of the Tate pairing. In this paper a new eff...
Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving
Elliptic Curve Cryptography (ECC) Double-base Chain Point Halving
2008/11/12
The fast implementation of elliptic curve cryptosystems relies on the efficient
computation of scalar multiplication. Based on the double-base chain representation of scalar
using powers of 2 and 3,...
Optimizing double-base elliptic-curve single-scalar multiplication
Edwards curves double-base number systems double-base
2008/5/23
This paper analyzes the best speeds that can be obtained
for single-scalar multiplication with variable base point by combining a
huge range of options:
– many choices of coordinate systems and for...