• Aucun résultat trouvé

Compact variable-base ECC scalar multiplication using Euclidean addition chains

N/A
N/A
Protected

Academic year: 2021

Partager "Compact variable-base ECC scalar multiplication using Euclidean addition chains"

Copied!
11
0
0

Texte intégral

Loading

Figure

Figure 1: Running an addition chain from (P , λP) .
Table 1: Field and chain sizes required for a given security level when φ satisfies φ 2 + rφ + s = 0 and (r,s) = (0, 1)/(1, 1)/(−1,2).
Table 3: Memory storage for a 128-bit security level Algorithm 4 ADD AFFINE(X 2 , Z 2 , X 3 , Z 3 ,X 1 )

Références

Documents relatifs

We propose an extension of pure type systems with an algebraic presentation of inductive and co-inductive type families with proper indices.. This type theory supports coercions

The resolution calls for a national multisectoral mechanism to address road safety as a public health issue; for specific actions to minimize injuries and their consequences and

I would also like to thank His Excellency, Dr Adel Khaled Al Sobeih, Minister of Public Health, and His Excellency Dr Abdel Rahman Al-Awadi, Chairman of the Kuwaiti Committee

Therefore, we note that so far, practical implementations of multiplication algorithms of type Chudnovsky over finite fields have failed to simultaneously optimize the number of

The report also examined the role of the media and politicians in ECC 2009, based on an analysis of media coverage in 15 countries (plus a more in-depth analysis of coverage in

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

Consequently, the property of Edwards curves does not protect Pairing Based Cryptography in Edwards coordinates toward fault attack.. A discussion about weakness to this fault attack

Our best algorithm is 11.11% faster thon the ordinary binary algorithm and speeds up accordingly the factorization and primality testing algorithms using elliptic