Elliptic curve cryptosystems and their implementation

DOI10.1007/BF00203817zbMath0782.94008MaRDI QIDQ1312102

Scott A. Vanstone, Alfred J. Menezes

Publication date: 19 January 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

public-key cryptographyelliptic curve cryptosystemsElGamal cryptosystemelliptic curve computations over finite fields

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

Further refinement of pairing computation based on Miller's algorithm ⋮ Elliptic curve scalar multiplication algorithm using complementary recoding ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Fast simultaneous scalar multiplication ⋮ Information authentication in automated control systems based on finite groups with multidimensional cyclicity ⋮ AN IDENTITY-BASED ENCRYPTION SCHEME USING ISOGENY OF ELLIPTIC CURVES

Cites Work

• Low complexity normal bases
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Optimal normal bases in \(GF(p^ n)\)
• Elliptic curve implementation of zero-knowledge blobs
• Arithmetic operations in \(GF(2^ m)\)
• An implementation for a fast public-key cryptosystem
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Fast evaluation of logarithms in fields of characteristic two
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Counting Points on Elliptic Curves Over F 2 m
• Reducing elliptic curve logarithms to logarithms in a finite field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Elliptic curve cryptosystems and their implementation