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.

"Rivest" redirects here. For other people with the same name, see Rivest (surname).
Ron Rivest
Rivest in 2012
Born
Ronald Linn Rivest

(1947-05-06) May 6, 1947
Schenectady, New York, U.S.
NationalityUnited States
Alma materStanford University (PhD)
Yale University
Known forPublic-key[1]
RSA, RC2, RC4, RC5, RC6
MD2, MD4, MD5, MD6, Ring signature
Awards
Scientific career
Fields
InstitutionsMassachusetts Institute of Technology
ThesisAnalysis of associative retrieval algorithms (1974)
Doctoral advisorRobert W. Floyd
Doctoral students
Websitepeople.csail.mit.edu/rivest/

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 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.

Education
Rivest (right) in March 1999.

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 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. Other contributions to the field of algorithms include the paper, "Time Bounds for Selection", which gives a worst-case linear-time algorithm.

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 McGraw-Hill. ISBN 978-0-262-03141-7.
  • Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press and McGraw-Hill. ISBN 978-0-262-53196-2.
  • Cormen, Thomas H.; Leiserson, Charles; Rivest, Ronald; Stein, Clifford (2009). Introduction to Algorithms (third ed.). MIT Press. ISBN 978-0-262-03384-8.

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 in 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]

gollark: You didn't think to say "hey, please could you add nonpython options", but just imposed the rule, see.
gollark: ???
gollark: The broader issue is that you have alienated a bunch of the community by imposing the noncompromise earlier.
gollark: As I said, I consider that compromise fine with regards to the specific issue it is actually addressing.
gollark: I don't actually have any authority whatsoever beyond helper powers and control of ██% of the bots here, really.

References
  1. Rivest, R. L.; Shamir, A.; Adleman, L. (1978). "A method for obtaining digital signatures and public-key cryptosystems". Communications of the ACM. 21 (2): 120–126. CiteSeerX 10.1.1.607.2677. doi:10.1145/359340.359342. ISSN 0001-0782.
  2. Ron Rivest publications indexed by Google Scholar
  3. Ron Rivest at the Mathematics Genealogy Project
  4. Singh, Mona (1996). Learning algorithms with applications to robot navigation and protein folding (PhD thesis). Massachusetts Institute of Technology. hdl:1721.1/40579. OCLC 680493381.
  5. RSA Conference (25 February 2014). "The Cryptographers' Panel" – via YouTube.
  6. https://www.youtube.com/watch?v=WDGh3-1itPw&t=1m The second syllable is stressed
  7. "TGDC members". National Institute of Standards and Technology. 2009-05-06. Archived from the original on 2007-06-08.
  8. 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
  9. A Generalization and Proof of the Aanderaa-Rosenberg Conjecture by Ronald L. Rivest and Jean Vuillemin
  10. Biography. Archived from the original on 2011-12-06.
  11. "Chisholm, Rivest, and Thompson appointed as new Institute Professors".
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.