scientific article; zbMATH DE number 2066373
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].
- The state of elliptic curve cryptography
- Generation and implementation of cryptographically strong elliptic curves
- Elliptic curves in cryptography
- Improving smart card security using elliptic curve cryptography over prime field \((F_{p})\)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- Security of an identity-based cryptosystem and the related reductions
- The magic of elliptic curves and public-key cryptography
- Discrete logarithms on elliptic curves
- A new elliptic curve based analogue of RSA
- Elliptic curves with the Montgomery-form and their cryptographic applications
- scientific article; zbMATH DE number 7303241 (Why is no real title available?)
- scientific article; zbMATH DE number 6262935 (Why is no real title available?)
- Adaptation of a cryptosystem based on the arithmetic of finite fields to elliptic curves
- Algebraic curves and cryptography
- Efficient generation of elliptic curve cryptosystems
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)