International audienceScalar recoding is popular to speed up ECC scalar multiplication: non-adjacent form, double-base number system, multi-base number system. But fast recoding methods require pre-computations: multiples of base point or off-line conversion. In this paper, we present a multi-base recoding method for ECC scalar multiplication based on i) a greedy algorithm starting least significant terms first, ii) cheap divisibility tests by multi-base elements and iii) fast exact divisions by multibase elements. Multi-base terms are obtained on-the-fly using a special recoding unit which operates in parallel to curve-level operations and at very high speed. This ensures that all recoding steps are performed fast enough to schedule the ne...
International audienceElliptic Curve Cryptography (ECC) is becoming unavoidable, and should be used ...
The main objective of this PhD thesis is to speedup elliptic curve cryptography (ECC) computations, ...
Empirical thesis.Bibliography: pages 91-92.1. Introduction -- 2. Background and related work -- 3. E...
International audienceScalar recoding is popular to speed up ECC scalar multiplication: non-adjacent...
National audienceEnsuring uniform computation profiles is an efficient protection against some side ...
Abstract: Development and research in cryptography has shown that RSA and Diffie-Hellman has is beco...
Elliptic Curve Cryptography (ECC) was introduced independently by Miller and Koblitz in 1986. Compar...
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scala...
This paper presents a series of Montgomery scalar multiplication algorithms on general short Weierst...
International audienceIn elliptic curve cryptography (ECC), arithmetic is a key element for designin...
An efficient scalar multiplication algorithm is a crucial component of elliptic curve cryptosystems....
This paper reduces the number of field multiplications required for scalar multiplication on conserv...
Elliptic curve cryptography (ECC) is gaining increasing popularity and acceptance within the resear...
High throughput while maintaining low resource is a key issue for elliptic curve cryptography (ECC) ...
International audienceElliptic Curve Cryptography (ECC) is becoming unavoidable, and should be used ...
The main objective of this PhD thesis is to speedup elliptic curve cryptography (ECC) computations, ...
Empirical thesis.Bibliography: pages 91-92.1. Introduction -- 2. Background and related work -- 3. E...
International audienceScalar recoding is popular to speed up ECC scalar multiplication: non-adjacent...
National audienceEnsuring uniform computation profiles is an efficient protection against some side ...
Abstract: Development and research in cryptography has shown that RSA and Diffie-Hellman has is beco...
Elliptic Curve Cryptography (ECC) was introduced independently by Miller and Koblitz in 1986. Compar...
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scala...
This paper presents a series of Montgomery scalar multiplication algorithms on general short Weierst...
International audienceIn elliptic curve cryptography (ECC), arithmetic is a key element for designin...
An efficient scalar multiplication algorithm is a crucial component of elliptic curve cryptosystems....
This paper reduces the number of field multiplications required for scalar multiplication on conserv...
Elliptic curve cryptography (ECC) is gaining increasing popularity and acceptance within the resear...
High throughput while maintaining low resource is a key issue for elliptic curve cryptography (ECC) ...
International audienceElliptic Curve Cryptography (ECC) is becoming unavoidable, and should be used ...
The main objective of this PhD thesis is to speedup elliptic curve cryptography (ECC) computations, ...
Empirical thesis.Bibliography: pages 91-92.1. Introduction -- 2. Background and related work -- 3. E...