Use of Elliptic Curves in Cryptography

@inproceedings{Miller1985UseOE,
  title={Use of Elliptic Curves in Cryptography},
  author={Victor S. Miller},
  booktitle={CRYPTO},
  year={1985}
}
  • Victor S. Miller
  • Published in CRYPTO 1985
  • Computer Science
  • We discuss the use of elliptic curves in cryptography. In particular, we propose an analogue of the Diffie-Hellmann key exchange protocol which appears to be immune from attacks of the style of Western, Miller, and Adleman. With the current bounds for infeasible attack, it appears to be about 20% faster than the Diffie-Hellmann scheme over GF(p). As computational power grows, this disparity should get rapidly bigger. 

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 2,963 CITATIONS

    FILTER CITATIONS BY YEAR

    1987
    2020

    CITATION STATISTICS

    • 280 Highly Influenced Citations

    • Averaged 135 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    A subexponential algorithm for the discrete logarithm problem with applications to cryptography

    • Leonard M. Adleman
    • Computer Science
    • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
    • 1979

    An improved algorithm for computing logarithms over GF ( p ) and its cryptgraphic significance , IEEE Inform

    • J. Buhler, B. Gross, D. Zagier, S. Pohlig, M. Hellman
    • 1978

    Monte Carlo methods for index computation ( mod p )

    • J. M. Pollard
    • Math . Comp .
    • 1978