Victor S. Miller

Victor Saul Miller (born March 3, 1947 in Brooklyn ) is an American mathematician and computer scientist .

Miller studied mathematics at Columbia University ( bachelor's degree in 1968) and received his doctorate in 1975 from Harvard University with Barry Mazur on number theory of elliptic curves ( Diophantine and p-Adic Analysis of Elliptic Curves and Modular Forms ). From 1973 to 1978 he was an assistant professor at the University of Massachusetts in Boston and from 1978 in the computer science department (since 1984 in the mathematics department) of the Thomas J. Watson Research Center at IBM . From 1993 he was a scientist at the Center for Communications Research (CCR) of the Institute for Defense Analyzes in Princeton .

Miller deals with algorithmic number theory , combinatorics , data compression and cryptography . He is co-inventor (next to Neal Koblitz ) of Elliptic Curve Cryptography and invented the LZW algorithm for data compression with Mark N. Wegman at about the same time as Terry Welch . In 1983 they applied for a patent for the LZW algorithm for IBM (as did Terry Welch for Sperry Corporation , who published his algorithm in 1984). They also introduced other variants (such as the LZMW algorithm in 1985). The LZW algorithm and its variants are used in numerous applications. In 1986 he described a cryptographic algorithm based on the Weil pairing on an algebraic curve. Miller also later dealt with cryptography based on algebraic curves.

Miller is a Fellow of the IEEE and received the Excellence in the Field of Mathematics Prize at the 2009 RSA conference . For 2020 he received the Eduard Rhein Foundation's Technology Prize .

Individual evidence

1. ^ V. Miller: Use of elliptic curves in cryptography. In: Advances in cryptology --- CRYPTO 85, Springer Lecture Notes in Computer Science, Volume 218, 1985, pp. 417-426. PDF file ( Memento from February 6, 2009 in the Internet Archive )
2. ↑ As an improvement of an algorithm by Abraham Lempel and Jacob Ziv from 1976, who are thus the actual founders of the LZ family of algorithms.
3. ^ Miller, Wegman: Variations on a theme by Ziv and Lempel. In: A. Apostolico and Z. Galil (editors): Combinatorial Algorithms on Words. NATO ASI Series F, Computer and Systems Sciences, Volume 12, Springer 1985, pp. 131-140
4. ↑ Miller's unpublished work on Weil Mating
5. ^ Miller: The Weil pairing and its efficient calculation. In: J. Cryptology. Volume 17, 2004, p. 235
6. ↑ RSA Conference Awards ( Memento of the original from December 21, 2009 in the Internet Archive ) Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. 
7. ↑ Prize of the Eduard Rhein Foundation 2020