Victor S. Miller

From Wikipedia, the free encyclopedia

Victor Saul Miller (born 3 March 1947 in Brooklyn, New York) is an American mathematician as a Principal Computer Scientist in the Computer Science Laboratory of SRI International. He received his B.A. in mathematics from Columbia University in 1968, and his Ph.D. in mathematics from Harvard University in 1975. He was an assistant professor in the Mathematics Department of the University of Massachusetts Boston from 1973 to 1978. In 1978 he joined the IBM 801 project in the Computer Science Department of the Thomas J. Watson Research Center in Yorktown Heights, New York, and moved to the Mathematics Department in 1984. From 1993-2022 he was on the Research Staff of Center for Communications Research (CCR) of the Institute for Defense Analyses in Princeton, New Jersey, U.S. In 2022 he was a Research Scientist in the Statistics and Privacy Group of Meta Platforms.

From 1984 through 1987 he was the editor of SIGACT news.[1]

His main areas of interest are in computational number theory, combinatorics, data compression and cryptography. He is one of the co-inventors of elliptic-curve cryptography.[2] He is also one of the co-inventors, with Mark Wegman, of the LZW data compression algorithm, and various extensions,[3] one of which is used in the V.42bis international modem standard.[4] He received an IEEE Millennium medal for this invention. He is also the inventor of Miller's Algorithm[5][6] which is of fundamental use in pairing-based cryptography. He is also one of the co-inventors of the Lagarias-Miller-Odlyzko prime counting algorithm.[7]

Miller is the recipient of the Certicom Recognition Award,[8] the RSA Award for Excellence in Mathematics which was given in the RSA Conference 2009,[9] the Eduard Rhein Stiftung Technology Award for 2020 [10] and the Levchin Prize [11] all for the invention of Elliptic Curve Cryptography. He is a Life Fellow of the IEEE, and a Fellow of the International Association for Cryptologic Research[12] and the Association for Computing Machinery.[13] He is also a member of Information Systems Security Association Hall of Fame [14]


  1. ^ The History of SIGACT News
  2. ^ V. Miller, Use of elliptic curves in cryptography, Advances in cryptology---CRYPTO 85, Springer Lecture Notes in Computer Science vol 218, 1985.[1]
  3. ^ U.S. patent 4,814,746
  4. ^ V. Miller and M. Wegman Variations on a theme by Ziv and Lempel in Combinatorial Algorithms on Words, ed. A. Apostolico and Z. Galil, NATO ASI Series F, Computer and Systems Sciences, Vol 12
  5. ^ V. Miller Short Programs for functions on curves", unpublished manuscript (1986)[2]
  6. ^ V. Miller The Weil Pairing, and its efficient calculation, J. Cryptology, v. 17 (2004) 235-261
  7. ^ J. Lagarias, V. Miller and A. Odlyzko "Computing π(x): the Meissel-Lehmer method" Math. Comp.v. 44 (1985) 537-560 [3]
  8. ^ Certicom press release
  9. ^ RSA Conference Awards
  10. ^ Eduard Rhein Foundation Technology Award
  11. ^ Levchin Prize
  12. ^ IACR Fellow Citation
  13. ^ ACM Fellow Citation
  14. ^ ISSA International Awards

External links[edit]