| 词条 | Ron Rivest |
| 释义 |
| name = Ron Rivest |image = |caption = Ronald Rivest in 2012 | birth_name = Ronald Linn Rivest | birth_date = {{Birth date and age|1947|5|6|mf=y}} | birth_place = Schenectady, New York | death_date = | death_place = | ethnicity = | residence = United States | nationality = American | field = {{Plainlist|
| work_institution = Massachusetts Institute of Technology | alma_mater = Stanford University (PhD) Yale University | thesis_title = Analysis of associative retrieval algorithms | thesis_url = http://worldcat.org/oclc/897011820 | thesis_year = 1974 | doctoral_advisor = Robert W. Floyd | doctoral_students = {{Plainlist|
| known_for = Public-key[2] RSA, RC2, RC4, RC5, RC6 MD2, MD4, MD5, MD6, Ring signature | author_abbreviation_bot = | author_abbreviation_zoo = | prizes = {{Plainlist|
| religion = | footnotes = }}Ronald Linn Rivest ({{IPAc-en|r|ɪ|ˈ|v|ɛ|s|t}};[3][4] born May 6, 1947) is a cryptographer and an Institute Professor at MIT.[5] 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.[6] Rivest is one of the inventors of the RSA algorithm (along with Adi Shamir and Len Adleman).[2] 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[7] and working with Jean Vuillemin to prove the deterministic form of the Aanderaa–Rosenberg conjecture.[8] EducationRivest 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.[9] Career and researchRivest 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. Rivest has research interests in algorithms, cryptography and voting.[5] His former doctoral students include Avrim Blum,[9] Burt Kaliski,[9] Ron Pinter,[9] Robert Schapire,[9] Alan Sherman,[9] and Mona Singh.[1] PublicationsHis publications[5] include:
| authorlink = Thomas H. Cormen | first1 = Thomas H. | last1 = Cormen | author2link = Charles E. Leiserson | last2 = Leiserson | first2 = Charles | last3 = Rivest | first3 = Ronald | title = Introduction to Algorithms | edition = first | publisher = MIT Press and McGraw-Hill | year = 1990 | isbn = 978-0-262-03141-7 | title-link = Introduction to Algorithms
| authorlink = Thomas H. Cormen | first1 = Thomas H. | last1 = Cormen | author2link = Charles E. Leiserson | last2 = Leiserson | first2 = Charles | last3 = Rivest | first3 = Ronald | author4link = Clifford Stein | last4 = Stein | first4 = Clifford | title = Introduction to Algorithms | publisher = MIT Press and McGraw-Hill | year = 2001 | isbn = 978-0-262-53196-2 | edition = second | title-link = Introduction to Algorithms
| authorlink = Thomas H. Cormen | first1 = Thomas H. | last1 = Cormen | author2link = Charles E. Leiserson | last2 = Leiserson | first2 = Charles | last3 = Rivest | first3 = Ronald | author4link = Clifford Stein | last4 = Stein | first4 = Clifford | title = Introduction to Algorithms | publisher = MIT Press | year = 2009 | isbn = 978-0-262-03384-8 | edition = third | title-link = Introduction to Algorithms Honors and awardsRivest 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] References1. ^1 {{cite thesis |degree=PhD |first=Mona|last=Singh |title=Learning algorithms with applications to robot navigation and protein folding |publisher=Massachusetts Institute of Technology |date=1996 |url=https://dspace.mit.edu/handle/1721.1/40579 |website=dspace.mit.edu |oclc=680493381 |hdl=1721.1/40579}} {{free access}} 2. ^1 {{cite journal|last1=Rivest|first1=R. L.|last2=Shamir|first2=A.|last3=Adleman|first3=L.|title=A method for obtaining digital signatures and public-key cryptosystems|journal=Communications of the ACM|volume=21|issue=2|year=1978|pages=120–126|issn=0001-0782|doi=10.1145/359340.359342|citeseerx=10.1.1.607.2677}} {{closed access}} 3. ^{{cite web|url=https://www.youtube.com/watch?v=gMc9fHvc78Y&t=1m7s|title=The Cryptographers' Panel|last=RSA Conference|date=25 February 2014|via=YouTube}} 4. ^https://www.youtube.com/watch?v=WDGh3-1itPw&t=1m The second syllable is stressed 5. ^1 2 3 4 5 {{Google scholar id}} 6. ^{{cite web|url=http://vote.nist.gov/tgdcmem.htm|title=TGDC members |archive-url=https://web.archive.org/web/20070608071658/http://vote.nist.gov/tgdcmem.htm |archive-date=2007-06-08 |publisher=National Institute of Standards and Technology|date=2009-05-06 }} 7. ^[https://people.csail.mit.edu/rivest/pubs/KR73.pdf 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 8. ^A Generalization and Proof of the Aanderaa-Rosenberg Conjecture by Ronald L. Rivest and Jean Vuillemin 9. ^1 2 3 4 5 6 7 8 9 10 11 {{MathGenealogy|id=50081}} 10. ^[https://www.webcitation.org/63jGW7VaO?url=http://people.csail.mit.edu/rivest/bio.html Biography]. Archived from the original on 2011-12-06. 11. ^{{cite web|url=http://newsoffice.mit.edu/2015/chisholm-rivest-thompson-institute-professors-0629|title=Chisholm, Rivest, and Thompson appointed as new Institute Professors}} External links{{Commons category|Ron Rivest}}
22 : American computer scientists|American cryptographers|1947 births|Living people|Computer security academics|Public-key cryptographers|Election technology people|International Association for Cryptologic Research fellows|Members of the United States National Academy of Sciences|Members of the United States National Academy of Engineering|Turing Award laureates|Massachusetts Institute of Technology faculty|Scientists from Schenectady, New York|Fellows of the Association for Computing Machinery|Yale University alumni|Stanford University alumni|People from Arlington, Massachusetts|20th-century American engineers|21st-century American engineers|20th-century American scientists|21st-century American scientists|Mathematicians from New York (state) |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。