行奄胸孕右右.PDF

Parallel scalar multiplication on general elliptic curves over F p hedged against Non-Dierential Side-Channel Attacks 1 2 Wieland Fischer , Christophe Giraud , Erik Wo o dward Knudsen2 and Jean-Pierre Seifert 1 1 Inneon Technologies, St. Martin-Strae 76, 81541 Munich, Germany. 2 Ob erthur Card Systems, 25, rue Auguste Blanche, 92800 Puteaux, France. Abstract. For sp eeding up elliptic curve scalar multiplication and mak- ing it secure against side-channel attacks such as timing or p ower analy- sis, various metho ds have b een prop osed using sp ecically chosen elliptic curves. We show that b oth goals can b e achieved simultaneously even for conventional elliptic curves over Fp . This result is shown via two facts. First, we recall the known fact that every elliptic curve over Fp admits a scalar multiplication via a (Montgomery ladder) Lucas chain. As such chains are known to b e resistant against timing- and simple p ower/electromagnetic radiation analysis attacks, the security of our scalar multiplication against timing and simple p ower/electromagnetic radiation analysis follows. Second, we show how to parallelize the 19 multiplications within the resulting \double and \add formulas of the Lucas chain for the scalar multiplication. This parallelism together with the Lucas chain results in 10 parallel eld multiplications p er bit of the scalar. Finally, we also rep ort on a concrete successful implementation of the ab ove mentioned scalar multiplication algorithm on a very recently de- velop ed and commercially