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.[1] In both 1966 and 1967, Schroeppel scored among the top 5 in the U.S. in the William Lowell Putnam Mathematical Competition.[2] In 1973 he discovered that there are 275,305,224 normal magic squares of order 5.[3] 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 integer 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,[4] and saw how to cut the run time to roughly by modifications that allowed sieving. This improvement doubled the size of numbers that 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.[5]
^"Lane Student Wins Top U.S. Math Award""Chicago Tribune, June 20, 1964".
^"The Mathematical Association of America's William Lowell Putnam Competition" (PDF).
^Sloane, N. J. A. (ed.). "Sequence A006052 (Number of magic squares of order n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^Morrison, Michael A.; Brillhart, John (January 1975). "A Method of Factoring and the Factorization of F7". Mathematics of Computation. 29 (129). American Mathematical Society: 183–205. doi:10.2307/2005475. JSTOR 2005475.
^"Erdős Number Project". Oakland University. Retrieved 16 August 2023.
and 19 Related for: Richard Schroeppel information
Richard C. Schroeppel (born 1948) is an American mathematician born in Illinois. His research has included magic squares, elliptic curves, and cryptography...
Schroeppel may refer to: Schroeppel, New York RichardSchroeppel, American mathematician This disambiguation page lists articles associated with the title...
Pudding cipher (HPC) is a variable-block-size block cipher designed by RichardSchroeppel, which was an unsuccessful candidate in the competition for selecting...
{3}{5}}n^{2}+\left({\tfrac {2}{7}}+{\tfrac {1}{2100}}\right)\!n+\cdots .} RichardSchroeppel in 1973 published the complete enumeration of the order 5 magic squares...
the original on 7 July 2007. Retrieved 2007-07-27. Niels Ferguson; RichardSchroeppel; Doug Whiting (2001). "A simple algebraic representation of Rijndael"...
was an Emmy and Peabody Award-winning voice-over announcer at WTTW. RichardSchroeppel is a mathematician. Nadine Barrie Smith was a medical researcher....
a cryptographic hash function designed in 2008 by Mark Torgerson, RichardSchroeppel, Tim Draelos, Nathan Dautenhahn, Sean Malone, Andrea Walker, Michael...
educational leadership in applied cryptology, and service to the IACR." RichardSchroeppel 2011 "For pioneering and analysing the sieving technique underlying...
Problem" (PDF). Archived (PDF) from the original on 2022-10-09. Schroeppel, Richard; Shamir, Adi (1981-08-01). "A T = O(2n/2), S = O(2n/4) algorithm...
numbers less than or equal to n by u(n) then u(n) behaves as follows: RichardSchroeppel stated in 1972 that the asymptotic probability that a randomly chosen...
Memo Schroeppel, Richard C.; Orman, Hilarie K. (1972-02-29). "compilation". HAKMEM. By Beeler, Michael; Gosper, Ralph William; Schroeppel, Richard C. (report)...
Github. Schroeppel, Richard C.; Orman, Hilarie K. (1972-02-29). "compilation". HAKMEM. By Beeler, Michael; Gosper, Ralph William; Schroeppel, Richard C. (report)...
(n/2))} , but requires O ( 2 n / 2 ) {\displaystyle O(2^{n/2})} space. Schroeppel and Shamir – runs in time O ( 2 n / 2 ⋅ ( n / 4 ) ) {\displaystyle O(2^{n/2}\cdot...
properties. It was invented by Carl Pomerance in 1981 as an improvement to Schroeppel's linear sieve. The algorithm attempts to set up a congruence of squares...
2021). "Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors". arXiv:2010.08576 [cs.DS]. Schroeppel, Richard; Shamir, Adi (August...
Scholl, Rich Schroeppel, Tom Scoville, Rony Sebok, Rhod Sharp, Bob Shur, Burrell Smith, David Snider, Tom Spence, Bud Spurgeon, Richard Stallman, Michael...
Schoolcraft, Michigan – Henry Schoolcraft (anthropologist) Schroeppel, New York – Henry W. Schroeppel (resident) Schuyler, Nebraska – Vice President Schuyler...
the other — such as N2, sqrt(N), log2(N), etc., appears in a paper by Schroeppel (1972). The result is not surprising, because the two-counter machine...
Global Information
