Cryptographic method with elliptical curves
An elliptic curve and cryptography technology, which is applied in the calculation using non-number system, calculation using residual algorithm, input/output of user/computer interaction, etc. It can solve problems such as non-check and attack.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0082] exist figure 1 A flow chart is shown in , which illustrates an embodiment of the method according to the invention. In a first step, a library with an elliptic curve E is provided (S1). The elliptic curve E is defined by a finite ontology K. Thus, the curve E contains a finite number of points P. As already described, elliptic curves pass through the Weierstrass equation with the parameter a 1 、a 2 、a 3 、a 4 and a 6 to make sure. Individual parameters can be zero by limiting or changing the parameterization accordingly. The parameters are chosen such that the elliptic curve is not singular.
[0083] The order of the elliptic curve is then determined (S2). The order of the elliptic curve is understood to be the number of points on the body K which satisfy the Weierstrass equation. Geometrically, this is all points P lying on the elliptic curve E.
[0084] The order of the elliptic curve (abbreviated ord(E)) should be a prime number. If the check reveals that...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 