• Aucun résultat trouvé

Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve

N/A
N/A
Protected

Academic year: 2021

Partager "Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve"

Copied!
9
0
0

Texte intégral

Loading

Figure

Table 1 – Complexity of curve operations in E( F p )
Figure 1 – Two-thread parallelization of double-and- double-and-add approach
Figure 2 – Optimized two-thread parallelization of double-and-add approach This implies that
Table 4 reports the timings obtained for the three parallel approaches discussed in Section 3

Références

Documents relatifs

Like GLV, our method involves reducing curves defined over number fields to obtain curves over finite fields with explicit CM.. However, we emphasise a profound difference: in

Galbraith, Lin, and Scott [9] and the author [26] have already con- structed families of endomorphisms equipped with a convenient ready-made basis; in this work, we generalize

The MICAz mote from Crossbow [9] is equipped with an ATmega128 processor clocked at 7.3728 MHz and powered by two 1.5 V batteries. As per [9], this processor draws an average current

The overall execution time of most elliptic curve cryptosystems is dominated by the time needed to perform a scalar multiplication, which, in turn, depends on a number of factors

Another scenario requiring a conversion of points is discussed in [30] and concerns standardized cryptosystems like ECDSA, which use (affine) Weierstraß coordinates as “wire

Therefore secure left-to-right scalar multiplication can be achieved either by using atomic pattern (2) and projective coordinates randomization which would involve fast doublings

For Huff curves, the authors of [5] give differential addition formulas for use with the Montgomery ladder. Furthermore, we contrast its performance with a reference implementation

Elliptic curves in the twisted µ 4 -normal form of this article (including split and semisplit variants) provide models for curves which, on the one hand, are isomor- phic to