Elliptic curve cryptosystems

@article{Koblitz1987EllipticCC,
  title={Elliptic curve cryptosystems},
  author={Neal Koblitz},
  journal={Mathematics of Computation},
  year={1987},
  volume={48},
  pages={203-209}
}
  • N. Koblitz
  • Published 1987
  • Mathematics
  • Mathematics of Computation
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 GF(2'). We discuss the question of primitive points on an elliptic curve modulo p, and give a theorem on nonsmoothness of the order of the… 

Figures and Tables from this paper

Non Supersingular Elliptic Curves for Public Key Cryptosystems
TLDR
For public key cryptosystems multiplication on elliptic curves can be used instead of exponentiation in finite fields via weilpairing, and every embedding in a multiplicative group of a finite field requires a field of very large size.
Public-key cryptosystems based on elliptic curves
  • J. Botes, W. T. Penzhorn
  • Mathematics
    1993 IEEE South African Symposium on Communications and Signal Processing
  • 1993
We discuss the use of elliptic curves in cryptography. Compared to the difficulty of solving the classical discrete logarithm problem, it appears that the elliptic curve analog of the discrete
On Ordinary Elliptic Curve Cryptosystems
  • A. Miyaji
  • Mathematics, Computer Science
    ASIACRYPT
  • 1991
TLDR
This paper investigates the condition for which this reducing to discrete logarithm problem in a finite field is invalid and shows the next two main results.
Cryptography on elliptic curves over p-adic number fields
TLDR
A cryptosystem based on the quotient groups of the group of rational points of an elliptic curve defined over p-adic number field is introduced, which has an advantage in performing point multiplication while keeping the security of ECC over finite fields.
Cryptography on elliptic curves over p-adic number fields
In this paper we introduce a cryptosystem based on the quotient groups of the group of rational points of an elliptic curve defined over p-adic number field. Some additional parameters are taken in
A nonlinear elliptic curve cryptosystem based on matrices
TLDR
A new mathematical problem is proposed that is applicable to public key cryptography that uses certain elements formed by two matrices with elements in a finite field and a matrix whose elements are points of an elliptic curve to get a larger key space without increasing the underlying elliptic Curve.
Y EMBEDDING FINITE FIELDS INTO ELLIPTIC CURVES ∗
Abstract. Many elliptic curve cryptosystems require an encoding function from a finite field Fq into Fq-rational points of an elliptic curve. We propose a uniform encoding to general elliptic curves
The implementation of elliptic curve cryptosystems
TLDR
This chapter explores the feasibility of efficient implementation of an arithmetic processor for performing elliptic curve computations over finite fields and concludes that the systems discussed here are both efficient and secure and very attractive for practical usage.
Elliptic curve cryptosystems using curves of smooth order over the ring Zn
TLDR
A new cryptosystem based on elliptic curves over the ring Z/sub n/, where n=pq, in which the message is held in the exponent and not the group element is presented, based on the difficulty of factoring n.
Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic
  • C. Nègre
  • Mathematics, Computer Science
    INDOCRYPT
  • 2005
TLDR
This paper establishes formulas multiplying by p a random point on an ordinary curve defined over $\mathbb{F}_{p^{n}}$, thereby improving scalar multiplication on random and special curves for p = 3 or 5 using a p-Multiply-and-Add method.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
Use of Elliptic Curves in Cryptography
  • V. Miller
  • Mathematics, Computer Science
    CRYPTO
  • 1985
TLDR
An analogue of the Diffie-Hellmann key exchange protocol is proposed which appears to be immune from attacks of the style of Western, Miller, and Adleman.
A public key cryptosystem and a signature scheme based on discrete logarithms
TLDR
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
A public key cryptosystem and a signature scheme based on discrete logarithms
A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the
Factoring integers with elliptic curves
TLDR
This paper is devoted to the description and analysis of a new algorithm to factor positive integers that depends on the use of elliptic curves and it is conjectured that the algorithm determines a non-trivial divisor of a composite number n in expected time at most K( p)(log n)2.
Discrete Logarithms in Finite Fields and Their Cryptographic Significance
  • A. Odlyzko
  • Mathematics, Computer Science
    EUROCRYPT
  • 1984
TLDR
This paper surveys and analyzes known algorithms in this area, with special attention devoted to algorithms for the fields GF(2n), finding that in order to be safe from attacks using these algorithms, the value of n for which GF( 2n) is used in a cryptosystem has to be very large and carefully chosen.
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
In this paper we present a deterministic algorithm to compute the number of F^-points of an elliptic curve that is defined over a finite field Fv and which is given by a Weierstrass equation. The
Elliptic Curves: Diophantine Analysis
I. General Algebraic Theory.- I. Elliptic Functions.- II. The Division Equation.- III. p-Adic Addition.- IV. Heights.- V. Kummer Theory.- V1. Integral Points.- II. Approximation of Logarithms.- VII.
A Course in Number Theory and Cryptography
1: Some Topics in Elementary Number Theory. 2: Finite Fields and Quadratic Residues. 3: Cryptography. 4: Public Key. 5: Primality and Factoring. 6: Elliptic Curves.
Optimal normal bases in GF(pn)
TLDR
This work has applications in crytography and coding theory since a reduction in the complexity of multiplying and exponentiating elements of GF(2n) is achieved for many values of n, some prime.
Speeding the Pollard and elliptic curve methods of factorization
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module N and occasionally taking GCDs with N. These began with Pollard's p 1
...
1
2
3
4
...