Branch Prediction Attack on Blinded Scalar Multiplication
Texte intégral
Figure
Documents relatifs
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
Keywords: ECC, scalar multiplication, Lim-Lee method, comb method, Koblitz curves, Frobenius endomorphism, τ-adic representation..
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
We then introduce a filtering method which, given a set of signatures and associated likelihood scores, select the blinded nonce bits to construct the lattice a way to maximize
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
Our techniques generalize with- out any difficulty to more general curves and Kummer surfaces, and then re- placing the fast Kummer operations described in Appendix A with more
The problem of formula optimization is to reduce the number of field operations to compute point multiplication and is difficult, we conjecture NP-complete.. By-hand, the
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