Elliptic curve cryptosystems and their implementation
type: Item
instance of: scholarly article
title: Elliptic curve cryptosystems and their implementation
zbMATH Open document ID: 0782.94008
DOI: 10.1007/BF00203817
author: Alfred Menezes
author: Scott A. Vanstone
published in: Journal of Cryptology
publication date: 1994-01-19T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 14G50
Mathematics Subject Classification ID: 11G20
zbMATH DE Number: 488169
zbMATH Keywords: elliptic curve cryptosystems
zbMATH Keywords: public-key cryptography
zbMATH Keywords: elliptic curve computations over finite fields
zbMATH Keywords: ElGamal cryptosystem
MaRDI profile type: Publication
cites work: Arithmetic operations in \(GF(2^ m)\)
cites work: An implementation for a fast public-key cryptosystem
cites work: Low complexity normal bases
cites work: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: Discrete logarithms in \(\mathrm{GF}(p)\)
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: A subexponential-time algorithm for computing discrete logarithms over&lt;tex&gt;GF(p^2)&lt;/tex&gt;
cites work: Q3775466
cites work: Elliptic Curve Cryptosystems
cites work: Q3792737
cites work: Q4279571
cites work: Elliptic curve implementation of zero-knowledge blobs
cites work: Q4035791
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: Q3349031
cites work: Counting Points on Elliptic Curves Over F 2 m
cites work: Q3718617
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: Optimal normal bases in \(GF(p^ n)\)
cites work: Q3726006
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Q3210171
cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
cites work: Q3710637
description: scientific article; zbMATH DE number 488169