Knowledge (XXG)

Richard Schroeppel

Source 📝

514: 527: 31: 520: 313:
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
623: 241: 304: 141:. 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 73: 564: 306:
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
150: 78: 593: 588: 402: 243:
steps was an important milestone in factoring and laid a foundation for much later work, including the current "champion" factoring algorithm, the
628: 63: 557: 142: 361: 598: 603: 550: 439: 162: 187: 375: 253: 430: 244: 176:
Among other contributions, Schroeppel was the first to recognize the sub-exponential running time of certain
608: 418: 618: 613: 170: 310:, which depends on the difficulty of factoring for its security, this was a critically important result. 106: 583: 158: 146: 250:
Schroeppel analyzed Morrison and Brillhart's algorithm, and saw how to cut the run time to roughly
451: 316: 177: 534: 443: 513: 526: 341: 314:
the section on "Smooth Numbers" on pages 1476–1477 of Pomerance's "A Tale of Two Sieves,"
134: 324: 30: 181: 166: 577: 307: 122: 493: 154: 138: 130: 392: 96: 149:. In both 1966 and 1967, Schroeppel scored among the top 5 in the U.S. in the 376:"The Mathematical Association of America's William Lowell Putnam Competition" 126: 44: 498: 455: 519: 336: 180:
algorithms. While not entirely rigorous, his proof that Morrison and
447: 397:"Sequence A006052 (Number of magic squares of order n)" 469: 396: 624:
International Association for Cryptologic Research fellows
153:. In 1973 he discovered that there are 275,305,224 normal 184:'s continued fraction factoring algorithm ran in roughly 538: 417:
Morrison, Michael A.; Brillhart, John (January 1975).
256: 190: 102: 92: 69: 59: 51: 37: 21: 533:This article about an American mathematician is a 298: 235: 236:{\displaystyle e^{\sqrt {2\ln {n}\ln {\ln {n}}}}} 419:"A Method of Factoring and the Factorization of 299:{\displaystyle e^{\sqrt {\ln {n}\ln {\ln {n}}}}} 151:William Lowell Putnam Mathematical Competition 558: 8: 565: 551: 29: 18: 403:On-Line Encyclopedia of Integer Sequences 287: 280: 269: 261: 255: 224: 217: 206: 195: 189: 157:of order 5. In 1998–1999 he designed the 165:, and he is one of the designers of the 359:"Lane Student Wins Top U.S. Math Award" 352: 7: 594:21st-century American mathematicians 589:20th-century American mathematicians 509: 507: 320:, Vol. 43, No. 12, December 1996.) 143:Mathematical Association of America 537:. You can help Knowledge (XXG) by 14: 525: 518: 512: 362:"Chicago Tribune, June 20, 1964" 161:, which was a candidate for the 494:Brief autobiographical outline 1: 440:American Mathematical Society 629:American mathematician stubs 499:Richard Schroeppel's website 163:Advanced Encryption Standard 129:. His research has included 121:(born 1948) is an American 645: 506: 431:Mathematics of Computation 393:Sloane, N. J. A. 112: 85: 28: 599:American cryptographers 470:"Erdős Number Project" 300: 237: 171:NIST SHA-3 competition 169:, a submission to the 16:American mathematician 604:Modern cryptographers 301: 238: 119:Richard C. Schroeppel 107:University of Arizona 472:. Oakland University 254: 188: 159:Hasty Pudding Cipher 147:Society of Actuaries 406:. OEIS Foundation. 317:Notices of the AMS 296: 245:number field sieve 233: 23:Richard Schroeppel 546: 545: 293: 230: 178:integer factoring 116: 115: 87:Scientific career 636: 567: 560: 553: 529: 524: 523: 522: 516: 508: 482: 481: 479: 477: 466: 460: 459: 414: 408: 407: 389: 383: 382: 380: 372: 366: 365: 357: 305: 303: 302: 297: 295: 294: 292: 291: 273: 262: 242: 240: 239: 234: 232: 231: 229: 228: 210: 196: 33: 19: 644: 643: 639: 638: 637: 635: 634: 633: 574: 573: 572: 571: 517: 511: 504: 490: 485: 475: 473: 468: 467: 463: 448:10.2307/2005475 425: 416: 415: 411: 391: 390: 386: 378: 374: 373: 369: 360: 358: 354: 350: 342:Counter machine 333: 257: 252: 251: 191: 186: 185: 135:elliptic curves 77: 60:Alma mater 47: 42: 24: 17: 12: 11: 5: 642: 640: 632: 631: 626: 621: 616: 611: 609:Putnam Fellows 606: 601: 596: 591: 586: 576: 575: 570: 569: 562: 555: 547: 544: 543: 530: 502: 501: 496: 489: 488:External links 486: 484: 483: 461: 423: 409: 384: 367: 351: 349: 346: 345: 344: 339: 332: 329: 290: 286: 283: 279: 276: 272: 268: 265: 260: 227: 223: 220: 216: 213: 209: 205: 202: 199: 194: 167:SANDstorm hash 114: 113: 110: 109: 104: 100: 99: 94: 90: 89: 83: 82: 71: 67: 66: 61: 57: 56: 53: 49: 48: 43: 39: 35: 34: 26: 25: 22: 15: 13: 10: 9: 6: 4: 3: 2: 641: 630: 627: 625: 622: 620: 619:Living people 617: 615: 614:Magic squares 612: 610: 607: 605: 602: 600: 597: 595: 592: 590: 587: 585: 582: 581: 579: 568: 563: 561: 556: 554: 549: 548: 542: 540: 536: 531: 528: 521: 515: 510: 505: 500: 497: 495: 492: 491: 487: 471: 465: 462: 457: 453: 449: 445: 441: 437: 433: 432: 427: 422: 413: 410: 405: 404: 398: 394: 388: 385: 377: 371: 368: 363: 356: 353: 347: 343: 340: 338: 335: 334: 330: 328: 326: 323:Schroeppel's 321: 319: 318: 311: 309: 308:RSA algorithm 288: 284: 281: 277: 274: 270: 266: 263: 258: 248: 246: 225: 221: 218: 214: 211: 207: 203: 200: 197: 192: 183: 179: 174: 172: 168: 164: 160: 156: 155:magic squares 152: 148: 144: 140: 136: 132: 131:magic squares 128: 124: 123:mathematician 120: 111: 108: 105: 101: 98: 95: 91: 88: 84: 80: 79:Putnam Fellow 75: 72: 68: 65: 62: 58: 54: 50: 46: 40: 36: 32: 27: 20: 539:expanding it 532: 503: 474:. Retrieved 464: 435: 429: 420: 412: 400: 387: 370: 355: 325:Erdős number 322: 315: 312: 249: 175: 139:cryptography 118: 117: 103:Institutions 86: 81:(1966, 1967) 584:1948 births 442:: 183–205. 97:Mathematics 74:IACR Fellow 52:Nationality 578:Categories 348:References 476:16 August 285:⁡ 278:⁡ 267:⁡ 222:⁡ 215:⁡ 204:⁡ 182:Brillhart 331:See also 145:and the 127:Illinois 125:born in 55:American 45:Illinois 456:2005475 438:(129). 395:(ed.). 76:(2011) 454:  337:HAKMEM 327:is 2. 137:, and 93:Fields 70:Awards 452:JSTOR 379:(PDF) 535:stub 478:2023 401:The 41:1948 38:Born 444:doi 64:MIT 580:: 450:. 436:29 434:. 428:. 399:. 282:ln 275:ln 264:ln 247:. 219:ln 212:ln 201:ln 173:. 133:, 566:e 559:t 552:v 541:. 480:. 458:. 446:: 426:" 424:7 421:F 381:. 364:. 289:n 271:n 259:e 226:n 208:n 198:2 193:e

Index


Illinois
MIT
IACR Fellow
Putnam Fellow
Mathematics
University of Arizona
mathematician
Illinois
magic squares
elliptic curves
cryptography
Mathematical Association of America
Society of Actuaries
William Lowell Putnam Mathematical Competition
magic squares
Hasty Pudding Cipher
Advanced Encryption Standard
SANDstorm hash
NIST SHA-3 competition
integer factoring
Brillhart
number field sieve
RSA algorithm
Notices of the AMS
Erdős number
HAKMEM
Counter machine
"Chicago Tribune, June 20, 1964"
"The Mathematical Association of America's William Lowell Putnam Competition"

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.