Richard Schroeppel (original) (raw)
Richard C. Schroeppel (* 1948 nahe Chicago in Illinois) ist ein US-amerikanischer Informatiker und Mathematiker, der sich mit Algorithmischer Zahlentheorie und Kryptographie beschäftigt. Schroeppel studierte am MIT, wo er 1968 seinen Bachelor-Abschluss machte. 1966 und 1967 war er dort Putnam Fellow. 1991 bis 1998 forschte er zu Computer-Sicherheitsfragen an der University of Arizona. Zurzeit arbeitet er an den Sandia National Laboratories. In den 1970er Jahren arbeitete er unter anderem mit Whitfield Diffie und Martin Hellman in Stanford an der Analyse der Sicherheit des DES.
| Property | Value |
|---|---|
| dbo:abstract | Richard C. Schroeppel (* 1948 nahe Chicago in Illinois) ist ein US-amerikanischer Informatiker und Mathematiker, der sich mit Algorithmischer Zahlentheorie und Kryptographie beschäftigt. Schroeppel studierte am MIT, wo er 1968 seinen Bachelor-Abschluss machte. 1966 und 1967 war er dort Putnam Fellow. 1991 bis 1998 forschte er zu Computer-Sicherheitsfragen an der University of Arizona. Zurzeit arbeitet er an den Sandia National Laboratories. Schroeppel war gemeinsam mit Michael Beeler und Ralph William (Bill) Gosper Mitautor des berühmten „Artificial-Intelligence-Memos“ (AIM-239 des MIT) vom 29. Februar 1972. Später entdeckte er die subexponentielle Laufzeit von einigen Faktorisierungsalgorithmen wie der Kettenbruchmethode, die er dann auch verbessern konnte (Methode des Linearen Siebes). Nach Carl Pomerance spielten seine Ideen, die er aber häufig nicht publizierte, eine Rolle bei der Entwicklung des Faktorisierungsalgorithmus des quadratischen Siebs von Pomerance selbst und auch beim Zahlkörpersieb. In den 1970er Jahren arbeitete er unter anderem mit Whitfield Diffie und Martin Hellman in Stanford an der Analyse der Sicherheit des DES. 1998/99 entwickelte er die Hasty Pudding Cipher als Kandidat im Wettbewerb um den Kryptografie-Standard AES. Er befasste sich auch mit Unterhaltungsmathematik und bestimmte zum Beispiel die Anzahl der Magischen Quadrate der Seitenlänge 5. (de) Richard C. Schroeppel (born 1948) is an American mathematician born in Illinois. His research has included magic squares, elliptic curves, and cryptography. In 1964, Schroeppel won first place in the United States among over 225,000 high school students in the Annual High School Mathematics Examination, a contest sponsored by the Mathematical Association of America and the Society of Actuaries. In both 1966 and 1967, Schroeppel scored among the top 5 in the U.S. in the William Lowell Putnam Mathematical Competition. In 1973 he discovered that there are 275,305,224 normal magic squares of order 5. In 1998–1999 he designed the Hasty Pudding Cipher which was a candidate for the Advanced Encryption Standard, and he is one of the designers of the SANDstorm hash, a submission to the NIST SHA-3 competition. Among other contributions, Schroeppel was the first to recognize the sub-exponential running time of certain factoring algorithms. While not entirely rigorous, his proof that Morrison and Brillhart's continued fraction factoring algorithm ran in roughly steps was an important milestone in factoring and laid a foundation for much later work, including the current "champion" factoring algorithm, the number field sieve. Schroeppel analyzed Morrison and Brillhart's algorithm, and saw how to cut the run time to roughly by modifications which allowed sieving. This improvement doubled the size of numbers which could be factored in a given amount of time. Coming around the time of the RSA algorithm, which depends on the difficulty of factoring for its security, this was a critically important result. Due to Schroeppel's apparent prejudice against publishing (though he freely circulated his ideas within the research community), and in spite of Pomerance noting that his quadratic sieve factoring algorithm owed a debt to Schroeppel's earlier work, the latter's contribution is often overlooked. (See the section on "Smooth Numbers" on pages 1476-1477 of Pomerance's "A Tale of Two Sieves," Notices of the AMS, Vol. 43, No. 12, December 1996.) Schroeppel's Erdős number is 2. (en) Richard C. Schroeppel (Illinois, 1948) é um matemático estadunidense. Suas pesquisas incluem quadrados mágicos, curvas elípticas e criptografia. Em 1964 Schroeppel conquistou o primeiro lugar nos Estados Unidos entre mais de 225.000 estudantes do ensino médio no Annual High School Mathematics Examination, um concurso patrocinado pela Mathematical Association of America e pela . Em 1966 e 1967 Schroeppel ficou entre os 5 primeiros nos Estados Unidos na . Em 1973 descobriu que existem 275.305.224 quadrados mágicos normais da ordem 5. Em 1998–1999 projetou a , candidata ao Advanced Encryption Standard, sendo um dos designers da , uma submissão à . Entre outras contribuições, Schroeppel foi o primeiro a reconhecer o tempo de execução subexponencial de certos algoritmos de fatoração. Embora não seja totalmente rigorosa, sua prova de que o algoritmo de fatoração de frações contínuas de Morrison e Brillhart foi executado em aproximadamente passos foi um marco importante no fatoramento e estabeleceu as bases para trabalhos posteriores, incluindo o atual algoritmo de fator "campeão", o campo de número de peneira geral. Schroeppel analisou o algoritmo de Morrison e Brillhart, e viu como reduzir o tempo de execução para aproximadamente por modificações que permitiram peneirar. Essa melhoria dobrou o tamanho dos números que poderiam ser fatorados em um determinado período de tempo. Chegando à época do algoritmo RSA, que depende da dificuldade de fatorar para sua segurança, esse foi um resultado extremamente importante. Devido à aparente recusa de Schroeppel pela publicação (embora ele circulasse livremente suas idéias dentro da comunidade de pesquisa), e apesar de Carl Pomerance notar que seu algoritmo de fatoração de peneiras quadráticas tinha uma dívida ao trabalho anterior de Schroeppel, a contribuição deste último é frequentemente ignorada. (Ver a seção "Smooth Numbers" nas páginas 1476-1477 de "A Tale of Two Sieves" de Pomerance, Notices of the AMS, Vol. 43, No. 12, dezembro de 1996.) O número de Erdős é 2. (pt) |
| dbo:academicDiscipline | dbr:Mathematics |
| dbo:almaMater | dbr:Massachusetts_Institute_of_Technology |
| dbo:award | dbr:International_Association_for_Cryptologic_Research dbr:William_Lowell_Putnam_Mathematical_Competition |
| dbo:birthPlace | dbr:Illinois |
| dbo:institution | dbr:University_of_Arizona |
| dbo:thumbnail | wiki-commons:Special:FilePath/Richard_Schroeppel_2004.jpg?width=300 |
| dbo:wikiPageExternalLink | http://richard.schroeppel.name:8015/ http://www.multimagie.com/English/Schroeppel.htm |
| dbo:wikiPageID | 1649527 (xsd:integer) |
| dbo:wikiPageLength | 4571 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1065021399 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Number_field_sieve dbr:University_of_Arizona dbr:International_Association_for_Cryptologic_Research dbr:Elliptic_curves dbc:Living_people dbr:Cryptography dbr:Massachusetts_Institute_of_Technology dbr:Mathematics dbr:Erdős_number dbr:Magic_square dbr:Mathematician dbc:1948_births dbc:20th-century_American_mathematicians dbc:21st-century_American_mathematicians dbc:American_cryptographers dbc:International_Association_for_Cryptologic_Research_fellows dbc:Magic_squares dbr:HAKMEM dbr:Hasty_Pudding_Cipher dbr:Advanced_Encryption_Standard dbr:William_Lowell_Putnam_Mathematical_Competition dbr:Counter_machine dbc:Putnam_Fellows dbc:Modern_cryptographers dbr:Illinois dbr:SANDstorm_hash dbr:NIST_SHA-3_competition |
| dbp:almaMater | dbr:Massachusetts_Institute_of_Technology |
| dbp:awards | dbr:International_Association_for_Cryptologic_Research Putnam Fellow (en) |
| dbp:birthDate | 1948 (xsd:integer) |
| dbp:birthPlace | dbr:Illinois |
| dbp:fields | dbr:Mathematics |
| dbp:name | Richard Schroeppel (en) |
| dbp:nationality | American (en) |
| dbp:wikiPageUsesTemplate | dbt:Authority_control dbt:Short_description dbt:Infobox_scientist dbt:US-mathematician-stub |
| dbp:workplaces | dbr:University_of_Arizona |
| dcterms:subject | dbc:Living_people dbc:1948_births dbc:20th-century_American_mathematicians dbc:21st-century_American_mathematicians dbc:American_cryptographers dbc:International_Association_for_Cryptologic_Research_fellows dbc:Magic_squares dbc:Putnam_Fellows dbc:Modern_cryptographers |
| rdf:type | owl:Thing foaf:Person dbo:Person dul:NaturalPerson wikidata:Q19088 wikidata:Q215627 wikidata:Q5 wikidata:Q729 yago:WikicatAmericanCryptographers yago:WikicatAmericanMathematicians yago:WikicatAmericanPeople dbo:Animal dbo:Eukaryote dbo:Scientist dbo:Species schema:Person yago:WikicatLivingPeople yago:WikicatModernCryptographers wikidata:Q901 yago:Associate109816771 yago:CausalAgent100007347 yago:Colleague109935990 yago:Cryptanalyst109981540 yago:Decoder109995398 yago:Intellectual109621545 yago:LivingThing100004258 yago:Mathematician110301261 yago:Object100002684 yago:Organism100004475 yago:Peer109626238 yago:Person100007846 yago:PhysicalEntity100001930 yago:YagoLegalActor yago:YagoLegalActorGeo yago:Scientist110560637 yago:Whole100003553 yago:Wikicat20th-centuryMathematicians yago:Wikicat21st-centuryMathematicians yago:WikicatPutnamFellows |
| rdfs:comment | Richard C. Schroeppel (* 1948 nahe Chicago in Illinois) ist ein US-amerikanischer Informatiker und Mathematiker, der sich mit Algorithmischer Zahlentheorie und Kryptographie beschäftigt. Schroeppel studierte am MIT, wo er 1968 seinen Bachelor-Abschluss machte. 1966 und 1967 war er dort Putnam Fellow. 1991 bis 1998 forschte er zu Computer-Sicherheitsfragen an der University of Arizona. Zurzeit arbeitet er an den Sandia National Laboratories. In den 1970er Jahren arbeitete er unter anderem mit Whitfield Diffie und Martin Hellman in Stanford an der Analyse der Sicherheit des DES. (de) Richard C. Schroeppel (born 1948) is an American mathematician born in Illinois. His research has included magic squares, elliptic curves, and cryptography. In 1964, Schroeppel won first place in the United States among over 225,000 high school students in the Annual High School Mathematics Examination, a contest sponsored by the Mathematical Association of America and the Society of Actuaries. In both 1966 and 1967, Schroeppel scored among the top 5 in the U.S. in the William Lowell Putnam Mathematical Competition. In 1973 he discovered that there are 275,305,224 normal magic squares of order 5. In 1998–1999 he designed the Hasty Pudding Cipher which was a candidate for the Advanced Encryption Standard, and he is one of the designers of the SANDstorm hash, a submission to the NIST SHA-3 c (en) Richard C. Schroeppel (Illinois, 1948) é um matemático estadunidense. Suas pesquisas incluem quadrados mágicos, curvas elípticas e criptografia. Em 1964 Schroeppel conquistou o primeiro lugar nos Estados Unidos entre mais de 225.000 estudantes do ensino médio no Annual High School Mathematics Examination, um concurso patrocinado pela Mathematical Association of America e pela . Em 1966 e 1967 Schroeppel ficou entre os 5 primeiros nos Estados Unidos na . Em 1973 descobriu que existem 275.305.224 quadrados mágicos normais da ordem 5. Em 1998–1999 projetou a , candidata ao Advanced Encryption Standard, sendo um dos designers da , uma submissão à . (pt) |
| rdfs:label | Richard Schroeppel (de) Richard Schroeppel (en) Richard Schroeppel (pt) |
| owl:sameAs | freebase:Richard Schroeppel yago-res:Richard Schroeppel https://dblp.org/pid/95/5359 wikidata:Richard Schroeppel dbpedia-de:Richard Schroeppel http://ht.dbpedia.org/resource/Richard_Schroeppel dbpedia-pt:Richard Schroeppel https://global.dbpedia.org/id/23WRK |
| prov:wasDerivedFrom | wikipedia-en:Richard_Schroeppel?oldid=1065021399&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Richard_Schroeppel_2004.jpg |
| foaf:isPrimaryTopicOf | wikipedia-en:Richard_Schroeppel |
| foaf:name | Richard Schroeppel (en) |
| is dbo:wikiPageDisambiguates of | dbr:Schroeppel |
| is dbo:wikiPageRedirects of | dbr:Schroeppel,_Richard dbr:Rich_Schroeppel dbr:Richard_C._Schroeppel |
| is dbo:wikiPageWikiLink of | dbr:Schroeppel,_Richard dbr:International_Association_for_Cryptologic_Research dbr:List_of_people_by_Erdős_number dbr:Magic_series dbr:Hasty_Pudding_cipher dbr:Lane_Tech_College_Prep_High_School dbr:Negative_base dbr:Orders_of_magnitude_(numbers) dbr:SANDstorm_hash dbr:Subset_sum_problem dbr:Schroeppel dbr:Unusual_number dbr:Rich_Schroeppel dbr:Richard_C._Schroeppel |
| is dbp:designers of | dbr:Hasty_Pudding_cipher |
| is foaf:primaryTopic of | wikipedia-en:Richard_Schroeppel |
