Victor S. Miller
Encyclopedia
Victor Saul Miller is an American mathematician at the Center for Communications Research (CCR) of the Institute for Defense Analyses
in Princeton, New Jersey, US. He received his A.B. 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. Since 1993 he has been at CCR.
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
. He is also one of the co-inventors, with Mark Wegman
, of the LZW
data compression algorithm, and various extensions, one of which is used in the V.42bis international modem standard. He received an IEEE Millenium medal for this invention. He is also the inventor of Miller's Algorithm 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 .
Miller is the recipient of the Excellence in the Field of Mathematics RSA Conference 2009 Award. and is a Fellow of the IEEE.
Institute for Defense Analyses
The Institute for Defense Analyses is a non-profit corporation that administers three federally funded research and development centers to assist the United States government in addressing important national security issues, particularly those requiring scientific and technical expertise...
in Princeton, New Jersey, US. He received his A.B. in mathematics from Columbia University
Columbia University
Columbia University in the City of New York is a private, Ivy League university in Manhattan, New York City. Columbia is the oldest institution of higher learning in the state of New York, the fifth oldest in the United States, and one of the country's nine Colonial Colleges founded before the...
in 1968, and his Ph.D. in mathematics from Harvard University
Harvard University
Harvard University is a private Ivy League university located in Cambridge, Massachusetts, United States, established in 1636 by the Massachusetts legislature. Harvard is the oldest institution of higher learning in the United States and the first corporation chartered in the country...
in 1975. He was an Assistant Professor in the Mathematics Department of the University of Massachusetts Boston
University of Massachusetts Boston
The University of Massachusetts Boston, also known as UMass Boston, is an urban public research university and the second largest campus in the five-campus University of Massachusetts system. The university is located on on Harbor Point in the City of Boston, Massachusetts, United States...
from 1973 to 1978. In 1978 he joined the IBM 801
IBM 801
The 801 was an experimental minicomputer designed by IBM. The resulting architecture was used in various roles in IBM until the 1980s. The 801 was started as a pure research project led by John Cocke in October 1975 at the Thomas J. Watson Research Center. The name 801 comes from the building the...
project in the Computer Science Department of the Thomas J. Watson Research Center
Thomas J. Watson Research Center
The Thomas J. Watson Research Center is the headquarters for the IBM Research Division.The center is on three sites, with the main laboratory in Yorktown Heights, New York, 38 miles north of New York City, a building in Hawthorne, New York, and offices in Cambridge, Massachusetts.- Overview :The...
in Yorktown Heights, New York, and moved to the Mathematics Department in 1984. Since 1993 he has been at CCR.
His main areas of interest are in Computational Number Theory
Computational number theory
In mathematics, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations...
, Combinatorics
Combinatorics
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size , deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria ,...
, Data Compression
Data compression
In computer science and information theory, data compression, source coding or bit-rate reduction is the process of encoding information using fewer bits than the original representation would use....
and Cryptography
Cryptography
Cryptography is the practice and study of techniques for secure communication in the presence of third parties...
. He is one of the co-inventors of Elliptic Curve Cryptography
Elliptic curve cryptography
Elliptic curve cryptography is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz and Victor S...
. He is also one of the co-inventors, with Mark Wegman
Mark Wegman
Mark N. Wegman is an American computer scientist known for his contributions to algorithms and compiler optimization. Wegman received his B.A. from New York University and his Ph.D. from the University of California, Berkeley. He joined IBM Research in 1975, where he currently serves as head of...
, of the LZW
LZW
Lempel–Ziv–Welch is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improved implementation of the LZ78 algorithm published by Lempel and Ziv in 1978...
data compression algorithm, and various extensions, one of which is used in the V.42bis international modem standard. He received an IEEE Millenium medal for this invention. He is also the inventor of Miller's Algorithm which is of fundamental use in pairing-based cryptography
Pairing-based cryptography
Pairing-based cryptography is the use of a pairing between elements of two cryptographic groups to a third group to construct cryptographic systems. If the same group is used for the first two groups, the pairing is called symmetric and is a mapping from two elements of one group to an element from...
. He is also one of the co-inventors of the Lagarias-Miller-Odlyzko prime counting algorithm .
Miller is the recipient of the Excellence in the Field of Mathematics RSA Conference 2009 Award. and is a Fellow of the IEEE.