Download PDFOpen PDF in browser Switch back to the title and the abstract in French Scheduling of operations used to obtain points in an ellyptic curveEasyChair Preprint no. 37042 pages•Date: June 29, 2020AbstractIn cryptographie, mathematicians use complex objects like the ellyptic curves. The encryption schemes execute operations on some points of these curves by making tangeant computations on their intersection with linear functions representations one after another. In practice, these computations are decomposed in basic mathematical operations on the definition body of the curve. Every basic operation is by herself decomposed in a sequence of elementary operations (addition/substraction and multiplication). By taking into account the number of curve operations executed in a normal case of implementation (several hundreds for a basic operation at the encryption level), a reduction in computation time even relatively small on the scheduling of these operations can be very useful. This generates an interesting scheduling problem for us. Keyphrases: Courbes elliptiques, Ordonnancement, PLNE
|