Ron Rivest
Ronald Linn Rivest (/rɪˈvɛst/;[5][6] born May 6, 1947) is a cryptographer and an Institute Professor at MIT.[2] 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). His work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity.
Ron Rivest  

Rivest in 2012  
Born  Ronald Linn Rivest May 6, 1947 
Residence  United States 
Nationality  American 
Alma mater  Stanford University (PhD) Yale University 
Known for  Publickey[1] RSA, RC2, RC4, RC5, RC6 MD2, MD4, MD5, MD6, Ring signature 
Awards 

Scientific career  
Fields  
Institutions  Massachusetts Institute of Technology 
Thesis  Analysis of associative retrieval algorithms (1974) 
Doctoral advisor  Robert W. Floyd 
Doctoral students 
Rivest is one of the inventors of the RSA algorithm (along with Adi Shamir and Len Adleman).[1] He is the inventor of the symmetric key encryption algorithms RC2, RC4, RC5, and coinventor 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.
Education
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 for research supervised by Robert W. Floyd.[3]
Career and research
At MIT Rivest is a member of the Theory of Computation Group, and founder of MIT CSAIL's Cryptography and Information Security Group.
He is a coauthor of Introduction to Algorithms (also known as CLRS), a standard textbook on algorithms, with Thomas H. Cormen, Charles E. Leiserson and Clifford Stein. Other contributions to the field of algorithms include the paper, "Time Bounds for Selection", which gives a worstcase lineartime algorithm for finding the median of a given set of numbers.
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. 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.[7]
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[8] and working with Jean Vuillemin to prove the deterministic form of the Aanderaa–Rosenberg conjecture.[9]
He was also a founder of RSA Data Security (now merged with Security Dynamics to form RSA Security), Verisign, and of Peppercoin. Rivest has research interests in algorithms, cryptography and voting.[2] His former doctoral students include Avrim Blum,[3] Burt Kaliski,[3] Anna Lysyanskaya, [3] Ron Pinter,[3] Robert Schapire,[3] Alan Sherman,[3] and Mona Singh.[4]
Publications
His publications[2] include:
 Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald (1990). Introduction to Algorithms (first ed.). MIT Press and McGrawHill. ISBN 9780262031417.
 Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press and McGrawHill. ISBN 9780262531962.
 Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2009). Introduction to Algorithms (third ed.). MIT Press. ISBN 9780262033848.
Honors and awards
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.[10] 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.[11]
References
 Rivest, R. L.; Shamir, A.; Adleman, L. (1978). "A method for obtaining digital signatures and publickey cryptosystems". Communications of the ACM. 21 (2): 120–126. CiteSeerX 10.1.1.607.2677. doi:10.1145/359340.359342. ISSN 00010782.
 Ron Rivest publications indexed by Google Scholar
 Ron Rivest at the Mathematics Genealogy Project
 Singh, Mona (1996). Learning algorithms with applications to robot navigation and protein folding. dspace.mit.edu (PhD thesis). Massachusetts Institute of Technology. hdl:1721.1/40579. OCLC 680493381.
 RSA Conference (25 February 2014). "The Cryptographers' Panel" – via YouTube.
 https://www.youtube.com/watch?v=WDGh31itPw&t=1m The second syllable is stressed
 "TGDC members". National Institute of Standards and Technology. 20090506. Archived from the original on 20070608.
 A procedure for improving the upper bound for the number of nominoes, 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 AanderaaRosenberg Conjecture by Ronald L. Rivest and Jean Vuillemin
 Biography. Archived from the original on 20111206.
 "Chisholm, Rivest, and Thompson appointed as new Institute Professors".
External links
Wikimedia Commons has media related to Ron Rivest. 