#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1977

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Don Johnson, Alfred Menezes, Scott A. Vanstone
- International Journal of Information Security
- 2001

The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard and in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete… (More)

- Laurie Law, Alfred Menezes, Minghua Qu, Jerome A. Solinas, Scott A. Vanstone
- Des. Codes Cryptography
- 2003

- Alfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto
- STOC
- 1991

Previously, no general-purpose algorithm was known for the elliptic curve logarithm problem that ran in better than exponential time. In this paper we demonstrate the reduction of the elliptic curve logarithm problem to the logarithm problem in the multiplicative group of an extension of the underlying hit e field. For the class of supersingular elliptic… (More)

- Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone
- CRYPTO
- 2001

The fundamental operation in elliptic curve cryptographic schemes is the multiplication of an elliptic curve point by an integer. This paper describes a new method for accelerating this operation on classes of elliptic curves that have efficiently-computable endomorphisms. One advantage of the new method is that it is applicable to a larger class of curves… (More)

- Neal Koblitz, Alfred Menezes, Scott A. Vanstone
- Des. Codes Cryptography
- 2000

Since the introduction of public-key cryptography by Diffie and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffie and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator… (More)

- Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone, R. M. Wilson
- Discrete Applied Mathematics
- 1989

- Kenji Koyama, Ueli Maurer, Tatsuaki Okamoto, Scott A. Vanstone
- CRYPTO
- 1991

Three new trapdoor one-way functions are proposed that are based on elliptic curves over the ring Z n. The rst class of functions is a naive construction, which can be used only in a digital signature scheme, and not in a public-key cryptosystem. The second, preferred class of function, does not suuer from this problem and can be used for the same… (More)

- Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone
- Journal of Cryptology
- 1991

In this paper we examine the development of a high-speed implementation of a system to perform exponentiation in fields of the form GF(2 n ). For sufficiently large n, this device has applications in public-key cryptography. The selection of representation and observations on the structure of multiplication have led to the development of an architecture… (More)

- Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone
- IEEE Journal on Selected Areas in Communications
- 1993