scientific article; zbMATH DE number 2066373

From MaRDI portal
Publication:4462811





The paper provides elliptic curve analogues of the discrete log problem, the Diffie-Hellman key exchange, the Massey-Omura protocol, and the public key cryptosystem ElGamal. For this, the author introduces elliptic curves over the complex field, the field of rational numbers, and finite fields. The security of these elliptic curve cryptosystems relies on the intractability of the discrete log analogue. It depends on the embedding of the curve into the multiplicative group of a finite field with \(q^k\) elements. The paper describes four methods to select appropriate elliptic curves which resist three well-known attacks. For the entire collection see [Zbl 1022.00013].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462811)