This biography of a living person needs additional citations for verification. (July 2015) (Learn how and when to remove this template message)
Ronald Linn Rivest (//; born May 6, 1947) is a cryptographer and an Institute Professor at MIT. He is a member of MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). He was a member of the Election Assistance Commission's Technical Guidelines Development Committee, tasked with assisting the EAC in drafting the Voluntary Voting System Guidelines.
|Ronald L. Rivest|
Ronald L. Rivest, 2012
May 6, 1947 |
Schenectady, New York
|Alma mater||Stanford University
RSA, RC2, RC4, RC5, RC6
MD2, MD4, MD5, MD6, Ring signature
|Awards||Paris Kanellakis Award (1996)
Turing Award (2002)
Marconi Prize (2007)
|Institutions||Massachusetts Institute of Technology|
|Doctoral advisor||Robert W. Floyd|
|Doctoral students||Avrim Blum
Rivest is one of the inventors of the RSA algorithm (along with Adi Shamir and Len Adleman). He is the inventor of the symmetric key encryption algorithms RC2, RC4, RC5, and co-inventor of RC6. The "RC" stands for "Rivest Cipher", or alternatively, "Ron's Code". (RC3 was broken at RSA Security during development; similarly, RC1 was never published.) He also authored the MD2, MD4, MD5 and MD6 cryptographic hash functions. In 2006, he published his invention of the ThreeBallot voting system, a voting system that incorporates the ability for the voter to discern that their vote was counted while still protecting their voter privacy. Most importantly, this system does not rely on cryptography at all. Stating "Our democracy is too important", he simultaneously placed ThreeBallot in the public domain.
Rivest frequently collaborates with other researchers in combinatorics; for example working with David A. Klarner to find an upper bound on the number of polyominoes of a given order, and working with Jean Vuillemin to prove the deterministic form of the Aanderaa–Rosenberg conjecture.
Rivest earned a Bachelor's degree in Mathematics from Yale University in 1969, and a Ph.D. degree in Computer Science from Stanford University in 1974. He is a co-author of Introduction to Algorithms (also known as CLRS), a standard textbook on algorithms, with Thomas H. Cormen, Charles E. Leiserson and Clifford Stein. He is a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) in the Theory of Computation Group, and a founder of its Cryptography and Information Security Group. He was also a founder of RSA Data Security (now merged with Security Dynamics to form RSA Security), Verisign, and of Peppercoin. Professor Rivest has research interests in cryptography, computer and network security, and algorithms.
Honors and awardsEdit
Rivest is a member of the National Academy of Engineering, the National Academy of Sciences, and is a Fellow of the Association for Computing Machinery, the International Association for Cryptologic Research, and the American Academy of Arts and Sciences. Together with Adi Shamir and Len Adleman, he has been awarded the 2000 IEEE Koji Kobayashi Computers and Communications Award and the Secure Computing Lifetime Achievement Award. He also shared with them the Turing Award. Rivest has received an honorary degree (the "laurea honoris causa") from the Sapienza University of Rome. In 2005, he received the MITX Lifetime Achievement Award. Rivest was named the 2007 the Marconi Fellow, and on May 29, 2008 he also gave the Chesley lecture at Carleton College. He was named an Institute Professor at MIT in June 2015.
- Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald (1990). Introduction to Algorithms (first ed.). MIT Press and McGraw-Hill. ISBN 0-262-03141-8.
- Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press and McGraw-Hill. ISBN 0-262-53196-8.
- Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2009). Introduction to Algorithms (third ed.). MIT Press. ISBN 0-262-03384-4.
- The second syllable is stressed
- TGDC members, from the National Institute of Standards and Technology
- A procedure for improving the upper bound for the number of n-ominoes, by D. A. Klarner and R. L. Rivest, Canadian Journal of Mathematics, Vol. XXV, No. 3, 1973, pp. 5
- A Generalization and Proof of the Aanderaa-Rosenberg Conjecture by Ronald L. Rivest and Jean Vuillemin
- Biography. Archived from the original on 2011-12-06.