#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1988

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Neal Koblitz, Neal Koblitz
- 2010

We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over… (More)

- Neal Koblitz
- Journal of Cryptology
- 1989

In this paper we discuss a source of finite abelian groups suitable for cryptosystems based on the presumed intractability of the discrete logarithm problem for these groups. They are the jacobians of hyperelliptic curves defined over finite fields. Special attention is given to curves defined over the field of two elements. Explicit formulas and examples… (More)

- Neal Koblitz, Alfred Menezes
- IMA Int. Conf.
- 2005

In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solution by Boneh and Franklin [7] of the problem of efficient identity-based encryption. At the same time, the security standards for public key cryptosystems are expected to increase,… (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)

- Neal Koblitz
- CRYPTO
- 1991

Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosystems: (1) they are nonsupersingular (so that one cannot use the Menezes-Okamoto-Vanstone reduction of discrete log from elliptic curves to finite fields); (2) the order of the… (More)

- R. Balasubramanian, Neal Koblitz
- Journal of Cryptology
- 1998

The security of elliptic curve cryptosystems is based on the presumed intractability of the discrete logarithm problem on the curve. Other than algorithms that work in an arbitrary group and are exponential in the general case, the only general-purpose algorithm that has ever been proposed for the elliptic curve discrete logarithm is that of… (More)

- Neal Koblitz, Alfred Menezes
- Algorithms and computation in mathematics
- 1998

- Neal Koblitz, Alfred Menezes
- Journal of Cryptology
- 2004

We give an informal analysis and critique of several typical "provable security" results. In some cases there are intuitive but convincing arguments for rejecting the conclusions suggested by the formal terminology and "proofs," whereas in other cases the formalism seems to be consistent with common sense. We discuss the reasons why the search for… (More)

- Michael R. Fellows, Neal Koblitz
- Des. Codes Cryptography
- 1992

For a number of computational search problems the existence of a polynomial time algorithm for the problem implies that a polynomial time algorithm for the problem is constructively known Some instances of such self witnessing polynomial time complexity are presented Our main result demonstrates this property for the problem of computing the prime… (More)

- Neal Koblitz
- CRYPTO
- 1998