搜索结果: 1-10 共查到“军队指挥学 elliptic curve cryptosystems”相关记录10条 . 查询时间(0.14 秒)
Efficient and Low-complexity Hardware Architecture of Gaussian Normal Basis Multiplication over GF(2m) for Elliptic Curve Cryptosystems
Finite Fields Elliptic Curve Cryptosystems Multiplication
2015/12/21
In this paper an efficient high-speed architecture of Gaussian normal basis multiplier over binary finite
field GF(2m) is presented. The structure is constructed by using regular modules for computat...
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
Elliptic curve cryptosystem scalar multiplication multiple scalar multiplication
2009/6/11
We present an innovative technique to add elliptic curve points with the
form P ± Q , and discuss its application to the generation of precomputed tables for
the scalar multiplication. Our analysis ...
On Implementation of GHS Attack against Elliptic Curve Cryptosystems over Cubic Extension Fields of Odd Characteristics
Elliptic curve cryptosystems Discrete logarithm problem GHS attack
2009/6/4
In this paper, we present algorithms for implementation of the GHS attack to Elliptic
curve cryptosystems (ECC). In particular, we consider two large classes of elliptic curves
over cubic extension ...
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...
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...
New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields（Full version）
Elliptic curve cryptosystem scalar multiplication point operation
2009/6/2
We present a new methodology to derive faster composite operations of
the form dP+Q, where d is a small integer ≥ 2, for generic ECC scalar
multiplications over prime fields. In particular, we prese...
Countermeasures against Side-Channel Attacks for Elliptic Curve Cryptosystems
Countermeasures Side-Channel Attacks Elliptic Curve Cryptosystems
2009/4/16
In recent years, some attacks on cryptographic systems have been deviced, exploiting
the leakage of information through so-called "side channels". When a real-life
device is performing a coding or d...
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptography fault analysis fault attacks
2009/4/8
Elliptic curve cryptosystems in the presence of faults were
studied by Biehl, Meyer and M¨uller (2000). The first fault model they
consider requires that the input point P in the computation of dP i...
A Weil Descent Attack against Elliptic Curve Cryptosystems over Quartic Extension Fields
Weil Descent Attack Elliptic Curve Cryptosystems Quartic Extension Fields
2009/3/27
This paper shows that many of elliptic curve cryptosystems over quartic
extension fields of odd characteristics are reduced to genus two hyperelliptic
curve cryptosystems over quadratic extension fi...
Sign Change Fault Attacks On Elliptic Curve Cryptosystems
elliptic curve cryptosystem fault attacks smartcards
2009/3/27
We present a new type of fault attacks on elliptic curve scalar
multiplications: Sign Change Attacks. These attacks exploit di erent number
representations as they are often employed in modern crypt...