Mostrar código-fonte de Ronald Rivest

{{Info/Biografia/Wikidata
|nome                =Ronald Rivest
|imagem              =Sherman, Rivest, and Chaum.jpg
|legenda             =Ronald Rivest (centro), com [[Alan Sherman]] (esquerda) e [[David Chaum]] (direita), em 2007
|data_nascimento     ={{dni|6|5|1947}}
|local_nascimento    =[[Schenectady, Nova Iorque|Schenectady]]
|nacionalidade       =[[Povo dos Estados Unidos|estadunidense]]
|campo               =[[matemática]], [[criptologia]]
|instituicao_trabalho={{nowrap|[[Instituto de Tecnologia de Massachusetts]]}}
|alma_mater          ={{nowrap|[[Universidade Stanford]]}}, {{nowrap|[[Universidade Yale]]}}
|orientador          =[[Robert Floyd]]<ref>{{MathGenealogy|id=50081}}</ref><ref>{{citar web |primeiro=Donald E. |último=Knuth |título=Memorial Resolution: Robert W. Floyd (1936-2001) |url=http://histsoc.stanford.edu/pdfmem/Floyd_Robert.pdf |obra=Stanford University Faculty Memorials |publicado=Stanford Historical Society |formato=PDF |acessodata=2014-04-30 |arquivourl=https://web.archive.org/web/20120312235958/http://histsoc.stanford.edu/pdfmem/Floyd_Robert.pdf |arquivodata=2012-03-12 |urlmorta=yes }}</ref>
|orientado           ={{nowrap|[[Avrim Blum]]}}, {{nowrap|[[Burt Kaliski]]}}, {{nowrap|[[Ron Pinter]]}}, {{nowrap|[[Robert Schapire]]}}, {{nowrap|[[Alan Sherman]]}}, {{nowrap|[[Mona Singh]]}}, {{nowrap|[[Andrew Sutherland]]}}
|premio              ={{nowrap|[[Prêmio Paris Kanellakis]] (1996)}}, {{nowrap|[[Prêmio Turing]] (2002)}}
}}
'''Ronald Linn Rivest''' ([[Schenectady, Nova Iorque|Schenectady]], {{dtlink|6|5|1947}}) é um [[matemático]] e [[Criptologia|criptologista]] [[Povo dos Estados Unidos|estadunidense]].

Foi laureado com o [[Prêmio Turing]] de 2002, juntamente com [[Adi Shamir]] e [[Leonard Adleman]], pelo algoritmo [[RSA]].

== Carreira e Pesquisa ==
No MIT, Rivest é membro do Grupo de [[Teoria da computação|Teoria da Computação]] e fundador do Grupo de Criptografia e [[Segurança da informação|Segurança da Informação]] do MIT CSAIL.

Ele é coautor de ''Introdução a Algoritmos'' (também conhecido como ''CLRS''), um livro-texto padrão sobre algoritmos, com Thomas H. Cormen, Charles E. Leiserson e Clifford Stein. Outras contribuições para o campo de algoritmos incluem o artigo, "Limites de tempo para seleção", que fornece um [[algoritmo]] de tempo linear de pior caso.<ref>[https://people.csail.mit.edu/rivest/BlumFloydPrattRivestTarjan-TimeBoundsForSelection.pdf people.csail.mit.edu - pdf]</ref><ref>{{Cite web |last=Press |first=The MIT |url=https://mitpress.mit.edu/books/introduction-algorithms-third-edition |title=Introduction to Algorithms, Third Edition &#124; The MIT Press |website=mitpress.mit.edu}}</ref> 

Em 2006, ele publicou sua invenção do sistema de votação ThreeBallot, um sistema de votação que incorpora a capacidade do eleitor de discernir que seu voto foi contado, ao mesmo tempo em que protege sua privacidade. Mais importante ainda, este sistema não depende de criptografia de forma alguma. Afirmando "Nossa democracia é muito importante", ele simultaneamente colocou ThreeBallot no [[domínio público]]. Ele era um membro da Comissão de Assistência Eleitoral - Election Assistance Commission (EAC) - do Comitê de Desenvolvimento Diretrizes técnico - Technical Guidelines Development Committee (TGDC) -, encarregado de assistir a EAC na elaboração das diretrizes do sistema voluntário de voto - Voluntary Voting System Guidelines -.<ref name="NIST">{{cite web |url=http://vote.nist.gov/tgdcmem.htm |title=TGDC members |date=2009-05-06 |publisher=[[National Institute of Standards and Technology]] |archive-url=https://web.archive.org/web/20070608071658/http://vote.nist.gov/tgdcmem.htm |archive-date=2007-06-08}}</ref>

== Publicações selecionadas ==
Suas publicações<ref>{{Citar web |url=https://scholar.google.com/citations?user=6qE0tdAAAAAJ&hl=en |titulo=Ronald L. Rivest |acessodata=2021-10-24 |website=scholar.google.com}}</ref> incluem:

=== Algoritmos ===
{{rma|A1|{{cite journal
 | last1 = Blum | first1 = Manuel | author1-link = Manuel Blum
 | last2 = Floyd | first2 = Robert W. | author2-link = Robert W. Floyd
 | last3 = Pratt | first3 = Vaughan | author3-link = Vaughan Pratt
 | last4 = Rivest | first4 = Ronald L. | author4-link = Ron Rivest
 | last5 = Tarjan | first5 = Robert E. | author5-link = Robert Tarjan
 | doi = 10.1016/S0022-0000(73)80033-9 | doi-access = free
 | journal = [[Journal of Computer and System Sciences]]
 | mr = 329916
 | pages = 448–461
 | title = Time bounds for selection
 | url = http://people.csail.mit.edu/rivest/pubs/BFPRT73.pdf
 | volume = 7
 | year = 1973| issue = 4 }} Previously announced as "Linear time bounds for median computations", STOC 1972.}}{{rma|A2|{{cite journal
 | last1 = Floyd | first1 = Robert W. | author1-link = Robert W. Floyd
 | last2 = Rivest | first2 = Ronald L. | author2-link = Ron Rivest
 | date = 1975
 | doi = 10.1145/360680.360691
 | issue = 3
 | journal = [[Communications of the ACM]]
 | pages = 165–172
 | s2cid = 3064709
 | title = Expected time bounds for selection
 | volume = 18| doi-access = free
 }} See also "Algorithm 489: the algorithm SELECT—for finding the {{nowrap|<math>i</math>th}} smallest of <math>n</math> elements", p. 173, {{doi|10.1145/360680.360694}}.}}{{rma|A3|{{cite journal
 | last = Rivest | first = Ronald L.
 | doi = 10.1137/0205003
 | issue = 1
 | journal = [[SIAM Journal on Computing]]
 | mr = 395398
 | pages = 19–50
 | title = Partial-match retrieval algorithms
 | volume = 5
 | year = 1976}} Previously announced at the 15th Annual Symposium on Switching and Automata Theory, 1974.}}{{rma|A4|{{cite journal
 | last = Rivest | first = Ronald
 | doi = 10.1145/359997.360000
 | issue = 2
 | journal = [[Communications of the ACM]]
 | mr = 0408303
 | pages = 63–67
 | title = On self-organizing sequential search heuristics
 | volume = 19
 | year = 1976| s2cid = 498886
 | doi-access = free
 }} Previously announced at the 15th Annual Symposium on Switching and Automata Theory, 1974.}}{{rma|A5|{{cite journal
 | last1 = Baker | first1 = Brenda S. | author1-link = Brenda Baker
 | last2 = Coffman | first2 = E. G. Jr. | author2-link = Edward G. Coffman Jr.
 | last3 = Rivest | first3 = Ronald L.
 | doi = 10.1137/0209064
 | issue = 4
 | journal = [[SIAM Journal on Computing]]
 | mr = 592771
 | pages = 846–855
 | title = Orthogonal packings in two dimensions
 | volume = 9
 | year = 1980| citeseerx = 10.1.1.309.8883}}}}{{rma|A6|{{cite conference
 | last1 = Rivest | first1 = Ronald L.
 | last2 = Fiduccia | first2 = Charles M.
 | editor1-last = Crabbe | editor1-first = James S.
 | editor2-last = Radke | editor2-first = Charles E.
 | editor3-last = Ofek | editor3-first = Hillel
 | contribution = A "greedy" channel router
 | doi = 10.1145/800263.809239
 | pages = 418–424
 | publisher = ACM and IEEE
 | title = Proceedings of the 19th Design Automation Conference, DAC '82, Las Vegas, Nevada, USA, June 14–16, 1982
 | year = 1982}}}}{{rma|A7|Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (1st ed.). MIT Press and McGraw-Hill. ISBN 0-262-03141-8. 2nd edition, with Clifford Stein, 2001. 3rd edition, 2009. 4th edition, 2022.}}

=== Criptografia ===
{{rma|C1|{{cite journal
 | last1 = Rivest | first1 = R. L.
 | last2 = Shamir | first2 = A. | author2-link = Adi Shamir
 | last3 = Adleman | first3 = L. | author3-link = Leonard Adleman
 | doi = 10.1145/359340.359342
 | issue = 2
 | journal = [[Communications of the ACM]]
 | mr = 700103
 | pages = 120–126
 | title = A method for obtaining digital signatures and public-key cryptosystems
 | volume = 21
 | year = 1978| s2cid = 2873616
 | doi-access = free
 }}}}{{rma|C2|{{cite book
 | last1 = Rivest | first1 = R.
 | last2 = Adleman | first2 = L. | author2-link = Leonard Adleman
 | last3 = Dertouzos | first3 = M. | author3-link = Michael Dertouzos
 | editor-last = DeMillo | editor-first = Richard A.
 | chapter = On data banks and privacy homomorphisms
 | pages = 169–177
 | publisher = Academic Press
 | title = Foundations of Secure Computation
 | year = 1978}}}}{{rma|C3|{{cite journal
 | last1 = Goldwasser | first1 = Shafi | author1-link = Shafi Goldwasser
 | last2 = Micali | first2 = Silvio | author2-link = Silvio Micali
 | last3 = Rivest | first3 = Ronald L.
 | doi = 10.1137/0217017
 | issue = 2
 | journal = [[SIAM Journal on Computing]]
 | mr = 935341
 | pages = 281–308
 | title = A digital signature scheme secure against adaptive chosen-message attacks
 | volume = 17
 | year = 1988| s2cid = 1715998 }} Previously announced as "A 'paradoxical' solution to the signature problem", FOCS 1984 and CRYPTO 1984.}}{{rma|C4|ivest, Ronald L. (October 1990). The MD4 Message Digest Algorithm. Network Working Group. doi:10.17487/RFC1186. RFC 1186.}}{{rma|C5|Rivest, Ronald L. (April 1992). The MD5 Message-Digest Algorithm. Network Working Group. doi:10.17487/RFC1321. RFC 1321.}}{{rma|C6|Rivest, Ronald L. (March 1998). A Description of the RC2(r) Encryption Algorithm. Network Working Group. doi:10.17487/RFC2268. RFC 2268.}}{{rma|C7|{{cite conference
 | last1 = Rivest | first1 = Ronald L.
 | last2 = Shamir | first2 = Adi | author2-link = Adi Shamir
 | last3 = Tauman | first3 = Yael | author3-link = Yael Tauman Kalai
 | editor-last = Boyd | editor-first = Colin
 | contribution = How to Leak a Secret
 | doi = 10.1007/3-540-45682-1_32
 | pages = 552–565
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Advances in Cryptology – ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9–13, 2001, Proceedings
 | volume = 2248
 | year = 2001| doi-access = free
 }}}}{{rma|C8|{{cite conference
 | last = Rivest | first = Ronald L.
 | editor-last = Preneel | editor-first = Bart
 | contribution = The RC5 encryption algorithm
 | doi = 10.1007/3-540-60590-8_7
 | pages = 86–96
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14–16 December 1994, Proceedings
 | volume = 1008
 | year = 1994| doi-access = free
 }}}}

=== Aprendizado ===
{{rma|L1|{{cite journal
 | last1 = Hyafil | first1 = Laurent
 | last2 = Rivest | first2 = Ronald L.
 | doi = 10.1016/0020-0190(76)90095-8
 | issue = 1
 | journal = [[Information Processing Letters]]
 | mr = 413598
 | pages = 15–17
 | title = Constructing optimal binary decision trees is NP-complete
 | volume = 5
 | date = May 1976}}}}{{rma|L2|{{cite journal
 | last = Rivest | first = Ronald L.
 | doi = 10.1007/BF00058680
 | issue = 3
 | journal = [[Machine Learning (journal)|Machine Learning]]
 | pages = 229–246
 | title = Learning decision lists
 | volume = 2
 | year = 1987| s2cid = 2840541
 | doi-access = free
 }}}}{{rma|L3|{{cite journal
 | last1 = Blum | first1 = Avrim | author1-link = Avrim Blum
 | last2 = Rivest | first2 = Ronald L.
 | doi = 10.1016/S0893-6080(05)80010-3
 | issue = 1
 | journal = [[Neural Networks (journal)|Neural Networks]]
 | pages = 117–127
 | title = Training a 3-node neural network is NP-complete
 | volume = 5
 | year = 1992| s2cid = 8567973 }} Previously in NIPS 1988.}}{{rma|L4|{{cite journal
 | last1 = Quinlan | first1 = J. Ross | author1-link = Ross Quinlan
 | last2 = Rivest | first2 = Ronald L.
 | doi = 10.1016/0890-5401(89)90010-2
 | issue = 3
 | journal = [[Information and Computation]]
 | mr = 984483
 | pages = 227–248
 | title = Inferring decision trees using the minimum description length principle
 | volume = 80
 | year = 1989}}}}{{rma|L5|{{cite journal
 | last1 = Rivest | first1 = Ronald L.
 | last2 = Schapire | first2 = Robert E. | author2-link = Robert Schapire
 | doi = 10.1006/inco.1993.1021
 | issue = 2
 | journal = [[Information and Computation]]
 | mr = 1216458
 | pages = 299–347
 | title = Inference of finite automata using homing sequences
 | volume = 103
 | year = 1993| doi-access = free
 }} Previously announced at STOC 1989.}}

=== Eleições e votação ===
{{rma|V1|{{cite conference
 | last1 = Jakobsson | first1 = Markus
 | last2 = Juels | first2 = Ari
 | last3 = Rivest | first3 = Ronald L.
 | editor-last = Boneh | editor-first = Dan
 | contribution = Making mix nets robust for electronic voting by randomized partial checking
 | contribution-url = https://www.usenix.org/publications/library/proceedings/sec02/jakobsson.html
 | location = Boston, Massachusetts
 | publisher = USENIX Association
 | pages = 339–353
 | title = Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, August 5-9, 2002
 | year = 2002}}}}{{rma|V2|{{cite conference
 | last1 = Rivest | first1 = Ronald L.
 | last2 = Smith | first2 = Warren D.
 | contribution = Three voting protocols: ThreeBallot, VAV, and Twin
 | contribution-url = https://www.usenix.org/legacy/events/evt07/tech/full_papers/rivest/rivest.pdf
 | date = 2007
 | location = Boston, Massachusetts
 | publisher = USENIX Association
 | title = 2007 USENIX/ACCURATE Electronic Voting Technology Workshop (EVT 07)}}}}{{rma|V3|{{cite conference
 | last1 = Chaum | first1 = David | author1-link = David Chaum
 | last2 = Carback | first2 = Richard
 | last3 = Clark | first3 = Jeremy
 | last4 = Essex | first4 = Aleksander
 | last5 = Popoveniuc | first5 = Stefan
 | last6 = Rivest | first6 = Ronald L.
 | last7 = Ryan | first7 = Peter Y. A.
 | last8 = Shen | first8 = Emily
 | last9 = Sherman | first9 = Alan T.
 | editor1-last = Dill | editor1-first = David L.
 | editor2-last = Kohno | editor2-first = Tadayoshi
 | contribution = Scantegrity II: end-to-end verifiability for optical scan election systems using invisible ink confirmation codes
 | contribution-url = https://www.usenix.org/events/evt08/tech/full\_papers/chaum/chaum.pdf
 | location = Boston, Massachusetts
 | publisher = USENIX Association
 | title = 2008 USENIX/ACCURATE Electronic Voting Workshop, EVT 2008, July 28-29, 2008, San Jose, CA, USA, Proceedings
 | year = 2008}}}}{{Referências}}

==Ligações externas==
{{Commons category|Ron Rivest}}
*{{Link|en|http://theory.lcs.mit.edu/~rivest/|Página pessoal no MIT}}

* [http://www.ipexl.com/share/fecba62ecb1bfc4a861cfb31ea1373d1 Lista de patentes de Ron Rivest sobre IPEXL] (em inglês)
* [http://people.csail.mit.edu/rivest/ Página inicial de Ronald L. Rivest] (em inglês)
* [http://www.rsasecurity.com/ Site oficial da RSA Security Inc.] (em inglês)
* [https://web.archive.org/web/20071213115534/http://www.electiontechnology.com/who.php?id=17 Artigos de pesquisa eleitoral de Ron Rivest] (em inglês)



{{Começa caixa}}
{{Caixa de sucessão
|título=[[Prêmio Turing]]
|anos=2002<br />{{nowrap|com [[Adi Shamir]] e [[Leonard Adleman]]}}
|antes={{nowrap|[[Ole-Johan Dahl]]}} e {{nowrap|[[Kristen Nygaard]]}}
|depois={{nowrap|[[Alan Kay]]}}
}}
{{Termina caixa}}


{{Prêmio Paris Kanellakis}}
{{Prêmio Turing}}
{{Portal3|Educação}}{{Controle de autoridade}}{{Esboço-cripto}}

{{DEFAULTSORT:Rivest, Ronald}}
[[Categoria:Prêmio Turing]]
[[Categoria:Membros da Academia Nacional de Ciências dos Estados Unidos]]
[[Categoria:Membros da Academia Nacional de Engenharia dos Estados Unidos]]
[[Categoria:Fellows da ACM]]
[[Categoria:Professores do Instituto de Tecnologia de Massachusetts]]
[[Categoria:Cientistas da computação dos Estados Unidos]]
[[Categoria:Criptógrafos dos Estados Unidos]]
[[Categoria:Alunos da Universidade Yale]]
[[Categoria:Alunos da Universidade Stanford]]
[[Categoria:Naturais de Schenectady]]