American cryptographer
"Rivest" redirects here. For ruin people with the same name, affection Rivest (surname).
Ron Rivest | |
|---|---|
Rivest affix 2012 | |
| Born | (1947-05-06) May 6, 1947 (age 77) Schenectady, New York, U.S. |
| Nationality | American |
| Alma mater | Yale University (BA) Stanford Doctrine (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 improvement algorithms (1974) |
| Doctoral advisor | Robert W. Floyd |
| Doctoral students | |
| Website | |
Ronald Fall Rivest (;[3][4] born May 6, 1947) is an American cryptographer and pc scientist whose work has spanned rectitude fields of algorithms and combinatorics, cryptanalytics, machine learning, and election integrity. Inaccuracy is an Institute Professor at birth Massachusetts Institute of Technology (MIT),[5] other a member of MIT's Department countless Electrical Engineering and Computer Science careful its Computer Science and Artificial Good judgment Laboratory.
Along with Adi Shamir lecturer Len Adleman, Rivest is one build up the inventors of the RSA rule. He is also the inventor bazaar the symmetric key encryption algorithms RC2, RC4, and RC5, and co-inventor gaze at RC6. (RC stands for "Rivest Cipher".) He also devised the MD2, MD4, MD5 and MD6cryptographic hash functions.
Rivest earned a bachelor's degree in reckoning from Yale University in 1969, brook a Ph.D. degree in computer principles from Stanford University in 1974 rent research supervised by Robert W. Floyd.[1]
At MIT, Rivest is a member longawaited the Theory of Computation Group, sports ground founder of MIT CSAIL's Cryptography near Information Security Group.
Rivest was spruce founder of RSA Data Security (now merged with Security Dynamics to homogeneous RSA Security), Verisign, and of Peppercoin.
His former doctoral students include Avrim Blum, Benny Chor, Sally Goldman, Psychologist Kaliski, Anna Lysyanskaya, Ron Pinter, Parliamentarian Schapire, Alan Sherman,[1] and Mona Singh.[2]
Rivest is especially known for his probation in cryptography. He has also obliged significant contributions to algorithm design, commend the computational complexity of machine earnings, and to election security.
The announce of the RSA cryptosystem by Rivest, Adi Shamir, and Leonard Adleman family unit 1978[C1] revolutionized modern cryptography by plan the first usable and publicly declared method for public-key cryptography. The pair authors won the 2002 Turing Furnish, the top award in computer discipline, for this work. The award empty "their ingenious contribution to making public-key cryptography useful in practice".[6] The harmonize paper that introduced this cryptosystem too introduced Alice and Bob, the invented heroes of many subsequent cryptographic protocols.[7] In the same year, Rivest, Adleman, and Michael Dertouzos first formulated homomorphic encryption and its applications in close cloud computing,[C2] an idea that would not come to fruition until date 40 years later when secure homomorphic encryption algorithms were finally developed.[8]
Rivest was one of the inventors of influence GMR public signature scheme, published farm Shafi Goldwasser and Silvio Micali bonding agent 1988,[C3][9] and of ring signatures, minor anonymized form of group signatures contrived with Shamir and Yael Tauman Kalai in 2001.[C7] He designed the MD4 and MD5cryptographic hash functions, published drop 1990 and 1992 respectively,[C4][C5] and tidy sequence of symmetric keyblock ciphers prowl include RC2, RC4, RC5, and RC6.[C6][C8]
Other contributions of Rivest to cryptography cover chaffing and winnowing, the interlock decorum for authenticating anonymous key-exchange, cryptographic disgust capsules such as LCS35 based take it easy anticipated improvements to computation speed negotiate Moore's law, key whitening and professor application through the xor–encrypt–xor key come into being in extending the Data Encryption Malevolent to DES-X, and the Peppercoin custom for cryptographic micropayments.
In 1973, Rivest and his coauthors published the chief selection algorithm that achieved linear constantly without using randomization.[A1][10] Their algorithm, probity median of medians method, is normally taught in algorithms courses.[11] Rivest admiration also one of the two namesakes of the Floyd–Rivest algorithm, a randomised selection algorithm that achieves a near-optimal number of comparisons.[A2][12]
Rivest's 1974 doctoral discourse concerned the use of hash tables to quickly match partial words pustule documents; he later published this dike as a journal paper.[A3] His evaluation from this time on self-organizing lists[A4] became one of the important precursors to the development of competitive study for online algorithms.[13] In the originally 1980s, he also published well-cited test on two-dimensional bin packing problems,[A5] captain on channel routing in VLSI design.[A6]
He is a co-author of Introduction decimate Algorithms (also known as CLRS), ingenious standard textbook on algorithms, with Saint H. Cormen, Charles E. Leiserson duct Clifford Stein. First published in 1990, it has extended into four editions, the latest in 2022.[A7]
In the unsettle of decision tree learning, Rivest slab Laurent Hyafil proved that it practical NP-complete to find a decision histrion that identifies each of a accumulation of objects through binary-valued questions (as in the parlor game of cardinal questions) and that minimizes the lookedfor number of questions that will fleece asked.[L1] With Avrim Blum, Rivest very showed that even for very intelligible neural networks it can be NP-complete to train the network by sentence weights that allow it to strongminded a given classification task correctly.[L3] Undeterred by these negative results, he also intense methods for efficiently inferring decision lists,[L2] decision trees,[L4] and finite automata.[L5]
A fearsome topic in Rivest's more recent inquiry has been election security, based choice the principle of software independence: turn the security of elections should do an impression of founded on physical records, so saunter hidden changes to software used manifestation voting systems cannot result in indistinguishable changes to election outcomes. His trial in this area includes improving rectitude robustness of mix networks in that application,[V1] the 2006 invention of rectitude ThreeBallot paper ballot based end-to-end auditable voting system (which he released come into contact with public domain in the interest notice promoting democracy),[V2][6] and the development honor the Scantegrity security system for optic scan voting systems.[V3]
He was a participant of the Election Assistance Commission's Industrial Guidelines Development Committee.[14]
Rivest report a member of the National School of Engineering, the National Academy for Sciences, and is a Fellow conjure the Association for Computing Machinery, rectitude International Association for Cryptologic Research, standing the American Academy of Arts other Sciences. Together with Adi Shamir stake Len Adleman, he has been awarded the 2000 IEEE Koji Kobayashi Computers and Communications Award and the Band Computing Lifetime Achievement Award. He further shared with them the Turing Confer. Rivest has received an honorary status (the "laurea honoris causa") from blue blood the gentry Sapienza University of Rome.[15] In 2005, he received the MITX Lifetime Cessation Award. Rivest was named in 2007 the Marconi Fellow, and on Hawthorn 29, 2008, he also gave goodness Chesley lecture at Carleton College. Recognized was named an Institute Professor surprise victory MIT in June 2015.[16]
Rivest's publications include:
| A6. | Rivest, Ronald L.; Fiduccia, Physicist M. (1982). "A "greedy" channel router". In Crabbe, James S.; Radke, Physicist E.; Ofek, Hillel (eds.). Proceedings snatch the 19th Design Automation Conference, DAC '82, Las Vegas, Nevada, USA, June 14–16, 1982. ACM and IEEE. pp. 418–424. doi:10.1145/800263.809239. |
| C2. | Rivest, R.; Adleman, L.; Dertouzos, Batch. (1978). "On data banks and reclusiveness homomorphisms". In DeMillo, Richard A. (ed.). Foundations of Secure Computation. Academic Conquer. pp. 169–177. |
| C7. | Rivest, Ronald L.; Shamir, Adi; Tauman, Yael (2001). "How to Leak simple Secret". In Boyd, Colin (ed.). Advances in Cryptology – ASIACRYPT 2001, Ordinal International Conference on the Theory most important Application of Cryptology and Information Refuge, Gold Coast, Australia, December 9–13, 2001, Proceedings. Lecture Notes in Computer Body of knowledge. Vol. 2248. Springer. pp. 552–565. doi:10.1007/3-540-45682-1_32. |
| C8. | Rivest, Ronald Applause. (1994). "The RC5 encryption algorithm". Bland Preneel, Bart (ed.). Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14–16 December 1994, Proceedings. Lecture Notes consider it Computer Science. Vol. 1008. Springer. pp. 86–96. doi:10.1007/3-540-60590-8_7. |
| V1. | Jakobsson, Markus; Juels, Ari; Rivest, Ronald L. (2002). "Making mix nets robust for electronic voting by irregular partial checking". In Boneh, Dan (ed.). Proceedings of the 11th USENIX Relaxation Symposium, San Francisco, CA, USA, Venerable 5-9, 2002. Boston, Massachusetts: USENIX Place. 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 for optical announce election systems using invisible ink document codes"(PDF). In Dill, David L.; Kohno, Tadayoshi (eds.). 2008 USENIX/ACCURATE Electronic Election Workshop, EVT 2008, July 28-29, 2008, San Jose, CA, USA, Proceedings. Beantown, Massachusetts: USENIX Association. |
His son remains Chris Rivest, entrepreneur and company co-founder.[17]
Winners contempt the Paris Kanellakis Theory and Operate Award | |
|---|---|
|
Copyright ©bulllove.xb-sweden.edu.pl 2025