In 1964, Richard Schroeppel outperformed more than 225,000 high school students to secure first place in the Annual High School Mathematics Examination. This early success signaled the trajectory of an American researcher whose later work in cryptography and computational number theory would provide critical building blocks for modern security protocols and algorithmic efficiency.
Academic Foundation
Born in Illinois in 1948, Schroeppel pursued his early education at Lane Technical College Prep High School. He later attended the Massachusetts Institute of Technology, where he continued to demonstrate mathematical aptitude. His performance at the university level earned him the designation of Putnam Fellow in both 1966 and 1967, reflecting his consistent presence among the top five competitors in the William Lowell Putnam Mathematical Competition.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Contributions to Integer Factoring
Schroeppel made significant strides in the analysis of integer factoring algorithms, specifically regarding the work of Morrison and Brillhart. He identified the sub-exponential running time of continued fraction factoring. By implementing modifications that utilized sieving, he reduced the run time to approximately e raised to the square root of ln n times ln ln n. This optimization effectively doubled the size of integers that could be factored within a set timeframe. This result proved essential given the emergence of the RSA algorithm, which relies on the computational difficulty of factoring for its security. Although his contributions were integral to the development of the quadratic sieve, they have sometimes been under-recognized due to his inclination toward sharing ideas within informal research circles rather than formal publication.
Cryptography and Computational Research
Beyond his work in pure mathematics, Schroeppel has contributed to applied cryptography. During 1998 and 1999, he participated in the design of the Hasty Pudding Cipher, which served as a candidate for the Advanced Encryption Standard. He also contributed to the design of the SANDstorm hash, a submission presented to the NIST SHA-3 competition. His earlier research interests spanned magic squares, where he calculated in 1973 that there are 275,305,224 normal magic squares of order 5, as well as work involving elliptic curves.
Fast facts
- Born: 1948, Illinois
- Citizenship: United States
- Education: Lane Technical College Prep High School; Massachusetts Institute of Technology
- Putnam Fellow: 1966, 1967
- IACR Fellow: 2011
- Erdos Number: 2
Questions readers ask
What is Richard Schroeppel's primary contribution to factoring?
He developed a sieve-based optimization for the Morrison and Brillhart continued fraction factoring algorithm that doubled the size of integers that could be factored in a given period.
Did Schroeppel contribute to the Advanced Encryption Standard?
Yes, he was a designer of the Hasty Pudding Cipher, which was a candidate for the AES competition.
.jpg)
