#### Filter Results:

#### Publication Year

2001

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Recently, Lenstra and Verheul proposed an efficient cryp-tosystem called XTR. This system represents elements of F * p 6 with order dividing p 2 − p + 1 by their trace over F p 2. Compared with the usual representation , this one achieves a ratio of three between security size and manipulated data. Consequently very promising performance compared with RSA… (More)

This paper introduces simple methods to convert a cryptographic algorithm into an algorithm protected against simple side-channel attacks. Contrary to previously known solutions, the proposed techniques are not at the expense of the execution time. Moreover, they are generic and apply to virtually any algorithm. In particular, we present several novel… (More)

Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and Müller (2000). The first fault model they consider requires that the input point P in the computation of dP is chosen by the adversary. Their second and third fault models only require the knowledge of P. But these two latter models are less 'practical' in the sense that… (More)

Recently, Eisenträger et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (2P + Q) from given points P and Q on an elliptic curve. Compared to the naive approach, the improved formulas save a field multiplication each time the operation is performed. This… (More)

Randomization techniques play an important role in the protection of cryptosystems against implementation attacks. This paper studies the case of elliptic curve cryptography and propose three novel randomization methods, for the elliptic curve point multiplication, which do not impact the overall performance. Our first method, dedicated to elliptic curves… (More)

In most algorithms involving elliptic curves, the most expensive part consists in computing multiples of points. This paper investigates how to extend the τ-adic expansion from Koblitz curves to a larger class of curves defined over a prime field having an efficiently-computable endomorphism φ in order to perform an efficient point multiplication with… (More)

Let E be an elliptic curve defined over F2n. The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have therefore proposed to perform a scalar multiplication by an " halve-and-add " algorithm, which is faster than the classical double-and-add method. If the coefficients of the equation… (More)

In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2 s i 3 t i , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n. It is conjectured that one can take c = 2 above. Then this decomposition is refined into an effective scalar multiplication algorithm to compute nP on some supersingular elliptic curves of… (More)

It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault inductions during RSA signature verification, we consider in this paper the signature counterpart. Our article introduces the first fault attack applied on RSA in standard mode. By… (More)