New Parallel Approaches for Scalar Multiplication in Elliptic Curve over Fields of Small Characteristic
Texte intégral
Figure
Documents relatifs
The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.. L’archive ouverte pluridisciplinaire HAL, est
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
In Section 2, we give some preliminaries on Coppersmith’s method, continued fractions, elliptic curves and recall the KMOV cryptosystem.. In Section 3, we present our first attack
We then present software implementation results of scalar multiplication over binary elliptic curve over two platforms: Intel Core 2 and Intel Core i5.. These experimental results
In Section IV we focus on genus 3 curves, following the same steps as for genus 2, we provide a divisor splitting algorithm, necessary addition formulas on the Jacobian, complexity
Thus, we have a Riccati foliation Ric on S 1 such that the generic leaf is a cover of degree 4 over C and it is the unique foliation transverse to the fibration.. Finally, taking