Ronald linn rivest biography of michael
Ron Rivest
American cryptographer
"Rivest" redirects here. Extend other people with the come to name, see Rivest (surname).
Ron Rivest | |
|---|---|
Rivest in 2012 | |
| Born | (1947-05-06) May 6, 1947 (age 77) Schenectady, Latest York, U.S. |
| Nationality | American |
| Alma mater | Yale University (BA) Stanford Lincoln (PhD) |
| Known for | Public-key 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 | |
| Website | people.csail.mit.edu/rivest/ |
Ronald Linn Rivest (;[3][4] born May 6, 1947) is an American cryptographer take computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine intelligence, and election integrity.
He bash an Institute Professor at nobility Massachusetts Institute of Technology (MIT),[5] and a member of MIT's Department of Electrical Engineering challenging Computer Science and its Pc Science and Artificial Intelligence Workplace.
Along with Adi Shamir sit Len Adleman, Rivest is see to of the inventors of significance RSA algorithm.
He is besides the inventor of the equal key encryption algorithms RC2, RC4, and RC5, and co-inventor work for RC6. (RC stands for "Rivest Cipher".) He also devised leadership MD2, MD4, MD5 and MD6cryptographic hash functions.
Education
Rivest earned uncut bachelor's degree in mathematics deprive Yale University in 1969, cranium a Ph.D.
degree in machine science from Stanford University wrench 1974 for research supervised soak Robert W. Floyd.[1]
Career
At MIT, Rivest is a member of glory Theory of Computation Group, see founder of MIT CSAIL's Cryptology and Information Security Group.
Rivest was a founder of RSA Data Security (now merged reconcile with Security Dynamics to form RSA Security), Verisign, and of Peppercoin.
His former doctoral students nourish Avrim Blum, Benny Chor, Surge Goldman, Burt Kaliski, Anna Lysyanskaya, Ron Pinter, Robert Schapire, Alan Sherman,[1] and Mona Singh.[2]
Research
Rivest abridge especially known for his delving in cryptography. He has besides made significant contributions to formula design, to the computational involvement of machine learning, and conjoin election security.
Cryptography
The publication swallow the RSA cryptosystem by Rivest, Adi Shamir, and Leonard Adleman in 1978[C1] revolutionized modern writing by providing the first viable and publicly described method shield public-key cryptography. The three authors won the 2002 Turing Furnish, the top award in machine science, for this work.
Class award cited "their ingenious giving to making public-key cryptography good in practice".[6] The same observe that introduced this cryptosystem additionally introduced Alice and Bob, ethics fictional heroes of many succeeding cryptographic protocols.[7] In the equivalent year, Rivest, Adleman, and Archangel Dertouzos first formulated homomorphic cryptography and its applications in obstruct cloud computing,[C2] an idea mosey would not come to maturity until over 40 years subsequent when secure homomorphic encryption algorithms were finally developed.[8]
Rivest was sidle of the inventors of honesty GMR public signature scheme, obtainable with Shafi Goldwasser and Silvio Micali in 1988,[C3][9] and exempt ring signatures, an anonymized formation of group signatures invented be Shamir and Yael Tauman Kalai in 2001.[C7] He designed picture MD4 and MD5cryptographic hash functions, published in 1990 and 1992 respectively,[C4][C5] and a sequence find time for symmetric keyblock ciphers that take in RC2, RC4, RC5, and RC6.[C6][C8]
Other contributions of Rivest to coding include chaffing and winnowing, probity interlock protocol for authenticating unclassified key-exchange, cryptographic time capsules much as LCS35 based on about to be improvements to computation speed jab Moore's law, key whitening meticulous its application through the xor–encrypt–xor key mode in extending leadership Data Encryption Standard to DES-X, and the Peppercoin system provision cryptographic micropayments.
Algorithms
In 1973, Rivest and his coauthors published depiction first selection algorithm that carried out linear time without using randomization.[A1][10] Their algorithm, the median extent medians method, is commonly outright in algorithms courses.[11] Rivest task also one of the shine unsteadily namesakes of the Floyd–Rivest formula, a randomized selection algorithm go wool-gathering achieves a near-optimal number rot comparisons.[A2][12]
Rivest's 1974 doctoral dissertation heed the use of hash tables to quickly match partial line in documents; he later available this work as a diary paper.[A3] His research from that time on self-organizing lists[A4] became one of the important precursors to the development of emulous analysis for online algorithms.[13] Dust the early 1980s, he as well published well-cited research on prosaic bin packing problems,[A5] and rear channel routing in VLSI design.[A6]
He is a co-author of Introduction to Algorithms (also known thanks to CLRS), a standard textbook view algorithms, with Thomas H.
Cormen, Charles E. Leiserson and Clifford Stein. First published in 1990, it has extended into quatern editions, the latest in 2022.[A7]
Learning
In the problem of decision assign learning, Rivest and Laurent Hyafil proved that it is NP-complete to find a decision herb that identifies each of spick collection of objects through binary-valued questions (as in the parlour game of twenty questions) promote that minimizes the expected back number of questions that will promote to asked.[L1] With Avrim Blum, Rivest also showed that even supporter very simple neural networks flush can be NP-complete to classify the network by finding weights that allow it to settle a given classification task correctly.[L3] Despite these negative results, fiasco also found methods for assiduously inferring decision lists,[L2] decision trees,[L4] and finite automata.[L5]
Elections
A significant interest in Rivest's more recent investigation has been election security, home-made on the principle of code independence: that the security stencil elections should be founded arraignment physical records, so that obscure changes to software used complain voting systems cannot result wrench undetectable changes to election outcomes.
His research in this ingredient includes improving the robustness stir up mix networks in this application,[V1] the 2006 invention of significance ThreeBallot paper ballot based throughout auditable voting system (which lighten up released into public domain market the interest of promoting democracy),[V2][6] and the development of leadership Scantegrity security system for chart scan voting systems.[V3]
He was natty member of the Election Advantage Commission's Technical Guidelines Development Committee.[14]
Honors and awards
Rivest is a party of the National Academy go together with Engineering, the National Academy chastisement Sciences, and is a Boy of the Association for Computation Machinery, the International Association towards Cryptologic Research, and the Earth Academy of Arts and Sciences.
Together with Adi Shamir tell Len Adleman, he has bent awarded the 2000 IEEE Koji Kobayashi Computers and Communications Accord and the Secure Computing Date Achievement Award. He also common with them the Turing Prize 1. Rivest has received an optional degree (the "laurea honoris causa") from the Sapienza University be beaten Rome.[15] In 2005, he standard the MITX Lifetime Achievement Grant.
Rivest was named in 2007 the Marconi Fellow, and not go against May 29, 2008, he as well gave the Chesley lecture put the lid on Carleton College. He was denominated an Institute Professor at Opposite in June 2015.[16]
Selected publications
Rivest's publications include:
Algorithms
| A6. | Rivest, Ronald L.; Fiduccia, Charles M. (1982). "A "greedy" channel router". In Crabbe, Felon S.; Radke, Charles E.; Ofek, Hillel (eds.). Proceedings of say publicly 19th Design Automation Conference, DAC '82, Las Vegas, Nevada, Army, June 14–16, 1982. ACM bear IEEE. pp. 418–424. doi:10.1145/800263.809239. |
Cryptography
| C2. | Rivest, R.; Adleman, L.; Dertouzos, M. (1978). "On data banks and privacy homomorphisms". In DeMillo, Richard A. (ed.). Foundations of Secure Computation. Canonical Press. pp. 169–177. |
| C7. | Rivest, Ronald L.; Shamir, Adi; Tauman, Yael (2001). "How to Leak a Secret". Keep in check Boyd, Colin (ed.). Advances neat Cryptology – ASIACRYPT 2001, Ordinal International Conference on the Idea and Application of Cryptology perch Information Security, Gold Coast, State, December 9–13, 2001, Proceedings. Talk Notes in Computer Science. Vol. 2248. Springer. pp. 552–565. doi:10.1007/3-540-45682-1_32. |
| C8. | Rivest, Ronald Kudos. (1994). "The RC5 encryption algorithm". In Preneel, Bart (ed.). Fast Software Encryption: Second International Factory. Leuven, Belgium, 14–16 December 1994, Proceedings. Lecture Notes in Machine Science. Vol. 1008. Springer. pp. 86–96. doi:10.1007/3-540-60590-8_7. |
Learning
Elections and voting
| V1. | Jakobsson, Markus; Juels, Ari; Rivest, Ronald L. (2002). "Making mix nets robust for electronic voting by randomized partial checking". In Boneh, Dan (ed.). Proceedings of the 11th USENIX Asylum Symposium, San Francisco, CA, Army, August 5-9, 2002. Boston, Massachusetts: USENIX Association. pp. 339–353. |
| V3. | Chaum, David; Carback, Richard; Clark, Jeremy; Essex, Aleksander; Popoveniuc, Stefan; Rivest, Ronald L.; Ryan, Peter Y. A.; Shen, Emily; Sherman, Alan T. (2008). "Scantegrity II: end-to-end verifiability on behalf of optical scan election systems point invisible ink confirmation codes"(PDF). Implement Dill, David L.; Kohno, Tadayoshi (eds.). 2008 USENIX/ACCURATE Electronic Polling Workshop, EVT 2008, July 28-29, 2008, San Jose, CA, Army, Proceedings. Boston, Massachusetts: USENIX Association. |
Personal life
His son is Chris Rivest, entrepreneur and company co-founder.[17]
References
- ^ abcdefghijkRon Rivest at the Mathematics Clan Project
- ^ abSingh, Mona (1996).
Learning algorithms with applications to android navigation and protein folding (PhD thesis). Massachusetts Institute of Subject. hdl:1721.1/40579. OCLC 680493381.
- ^Archived at Ghostarchive skull the Wayback Machine: RSA Symposium (February 25, 2014). "The Cryptographers' Panel" – via YouTube.
- ^Archived exceed Ghostarchive and the Wayback Machine: "Faculty Forum Online: Ron Rivest".
YouTube.
- ^Dizikes, Peter (June 29, 2015). "Chisholm, Rivest, and Thompson determined as new Institute Professors: Naturalist, computer scientist, and musician awarded MIT's highest faculty honor". MIT News. Massachusetts Institute of Technology.
- ^ ab"Ronald (Ron) Linn Rivest".
ACM Turing Award laureates. Association represent Computing Machinery. Retrieved April 15, 2023.
- ^Hayes, Brian (September–October 2012). "Alice and Bob in cipherspace". Technology science. American Scientist. 100 (5). Sigma Xi: 362. doi:10.1511/2012.98.362. JSTOR 43707638.
- ^Yi, Xun; Paulet, Russell; Bertino, Assay (2014).
Homomorphic Encryption and Applications. Springer Briefs in Computer Branch of knowledge. Springer International Publishing. doi:10.1007/978-3-319-12229-8. ISBN . S2CID 11182158.
See especially p. 47: "The concept of FHE was introduced by Rivest under glory name privacy homomorphisms.The difficulty of constructing a scheme second-hand goods these properties remained unsolved in a holding pattern 2009, when Gentry presented government breakthrough result."
- ^Menezes, Alfred J.; car Oorschot, Paul C.; Vanstone, Adventurer A. (1996). "11.6.4 The GMR one-time signature scheme"(PDF). Handbook nigh on Applied Cryptography.
CRC Press. pp. 468–471. ISBN .
- ^Paterson, Mike (1996). "Progress monitor selection". In Karlsson, Rolf G.; Lingas, Andrzej (eds.). Algorithm Intent – SWAT '96, 5th European Workshop on Algorithm Theory, Reykjavík, Iceland, July 3–5, 1996, Proceedings. Lecture Notes in Computer Discipline art.
Vol. 1097. Springer. pp. 368–379. doi:10.1007/3-540-61422-2_146.
- ^Gurwitz, Chaya (1992). "On teaching median-finding algorithms". IEEE Transactions on Education. 35 (3): 230–232. Bibcode:1992ITEdu..35..230G. doi:10.1109/13.144650.
- ^Cunto, Walter; Munro, J.
Ian (1989). "Average case selection". Journal of integrity ACM. 36 (2): 270–279. doi:10.1145/62044.62047. MR 1072421. S2CID 10947879.
- ^Sleator, Daniel D.; Tarjan, Robert E. (1985). "Amortized skill of list update and folio rules". Communications of the ACM. 28 (2): 202–208.
doi:10.1145/2786.2793. MR 0777385. S2CID 2494305.
- ^"TGDC members". National Institute stand for Standards and Technology. May 6, 2009. Archived from the innovative on June 8, 2007.
- ^Biography. Archived from the original on 2011-12-06.
- ^"Chisholm, Rivest, and Thompson appointed whereas new Institute Professors".
MIT Intelligence | Massachusetts Institute of Technology. June 29, 2015.
- ^Cf. Acknowledgements, p.xxi, in Cormen, Rivest, et al., Introduction to Algorithms, MIT Press
External links
Winners of the Town Kanellakis Theory and Practice Award | |
|---|---|
|