CM-curves with good cryptographic properties (Q4035791)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | CM-curves with good cryptographic properties |
scientific article; zbMATH DE number 176613 |
Statements
18 May 1993
0 references
CM-curves
0 references
primality test
0 references
efficient Diffie-Hellman cryptosystems
0 references
number of rational points on anomalous curves
0 references
0.8391206860542297
0 references
CM-curves with good cryptographic properties (English)
0 references
[For the entire collection see Zbl 0753.00024.] In this paper elliptic curves are described which in characteristic 2 can be used to construct efficient Diffie-Hellman cryptosystems which are secure at the present state of affairs. Elliptic curves over a finite field \(\mathbb{F}_ q\) are called anomalous by the author if the trace of the Frobenius map is 1. The main theorem shows that for anomalous elliptic curves the cost of multiplying points can be reduced considerably. Since these curves are not supersingular the discrete log problem on them cannot be traced to the discrete log problem in the multiplicative group of a small extension of the ground field by the Menezes-Okamoto-Vanstone approach [Proc. 23rd ACM Symp. theory of computing, 1991]. Moreover a simple algorithm is given to compute the number of rational points on anomalous curves over extensions of the ground field. From the cryptographic point of view one wishes the number of points to be the product of a large prime and a small factor. In the second part of the paper examples of anomalous (CM)-curves with suitable order are given over \(\mathbb{F}_ 2\), \(\mathbb{F}_ 4\), \(\mathbb{F}_ 8\) and \(\mathbb{F}_{16}\). In the last section the author makes some remarks which speed up the computations even more.
0 references