Patent ID: 8666066
Filing Date: 2014-03-04
Classification: H04L

Abstract:
1. A method of executing a cryptographic computation in an electronic component comprising: obtaining points P on an elliptic curve satisfying the following equation: where a where A is a ring of the modular integers Z/qZ where q is a positive integer product of a number I of different prime numbers that are strictly greater than 3, I being an integer greater than or equal to 2, or A is a finite field F where X and Y are the coordinates of the points P and are elements of A, said method further comprising: /a/ determining a parameter; /b/ obtaining coordinates X and Y of a point P by applying a function to said parameter; the Euler function φ of A satisfying the equation: φ(A) mod 3=1, the function being an invertible and deterministic function expressed by a rational fraction in a /c/ using said point P in a cryptographic encryption or hash or signature or authentication or identification application.