George B. Purdy

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
George Barry Purdy
Born20 February 1944
Died30 December 2017
Cincinnati, Ohio, United States
Alma materUniversity of Illinois
Known for
Scientific career
FieldsMathematics and computer science
Doctoral advisor
Other academic advisorsRichard Rado
He has an Erdős number of one.

George Barry Purdy (20 February 1944 – 30 December 2017)[2] was a mathematician and computer scientist who specialized in cryptography, combinatorial geometry and number theory. Purdy received his Ph.D. from the University of Illinois at Urbana–Champaign in 1972, officially under the supervision of Paul T. Bateman,[1] but his de facto adviser was Paul Erdős.[citation needed] He was on the faculty in the mathematics department at Texas A&M University for 11 years, and was appointed the Geier Professor of computer science at the University of Cincinnati in 1986.

Purdy had Erdős number one and coauthored many papers with Paul Erdős, who regarded him as his own student.[citation needed] He is the "P" in G.W. Peck, a pseudonym for the group of mathematicians that also included Ronald Graham, Douglas West, Paul Erdős, Fan Chung, and Daniel Kleitman.[3]

Purdy polynomial[edit]

In 1971, Purdy was asked by Larry Roberts, the head of DARPA, to develop a secure hash function to protect passwords on ARPANET. Purdy developed the so-called Purdy polynomial, which was a polynomial of degree 224 + 17 computed modulo the 64-bit prime p = 264 - 59. The terms of the polynomial could be computed using modular exponentiation. DARPA was satisfied with the hash function, and also allowed Purdy to publish it in Communications of the ACM. It was well received around the world, and DEC eventually used it in their OpenVMS operating system. A DEC report said they chose it because it was very secure, and also because the existing standard DES could not be exported, which meant that an alternative was needed.[4][5] OpenVMS[6] uses a 64-bit version, based on a 64-bit prime, the same size as the one in the paper.

Purdy's conjecture[edit]

While at Texas A&M, Purdy made an empirical observation about distances between points on two lines. Suppose that n points are to be chosen on line L and another n points on line M. If L and M are perpendicular or parallel, then the points can be chosen so that the number of distinct distances determined is bounded by a constant multiply of n, but otherwise the number is much larger. Erdős was very struck by this conjecture and told it to many others, and it was published in a book of unsolved problems by William Moser in 1981.[7] It came to the attention of György Elekes, who eventually proved the conjecture as the first application of new tools from algebraic geometry that he was developing.[8] After Elekes's untimely death, Micha Sharir collected Elekes's notes and published an organized presentation of these algebraic methods, including work of his own. This, in turn, enabled Katz and Guth to solve the Erdős distinct distances problem, a 1946 problem of Erdős. Work continues on improvements in Purdy's conjecture.[9]


In 2015, Purdy was awarded the IEEE Joseph Desch Award for Innovation for his work on the Arpa Network and the Purdy Polynomial.

Selected publications[edit]

  • Erdős, Paul; Purdy, George B. (September 1978). "Some combinatorial problems in the plane". Journal of Combinatorial Theory, Series A. Elsevier. 25 (2): 205–210. doi:10.1016/0097-3165(78)90085-7.
  • Purdy, George B. (2006). "A Collision-free Cryptographic Hash Function Based on Factorization". Congressus Numerantium. 180: 161–166.
  • Purdy, George B. (December 1988). "Repeated Angles in E4". Discrete and Computational Geometry. Springer New York. 3 (1): 73–75. doi:10.1007/BF02187897. ISSN 0179-5376.


  1. ^ a b George Barry Purdy at the Mathematics Genealogy Project
  2. ^ "Dr. George B. Purdy Phd Obituary - Cincinnati, OH | ObitTree™". Retrieved 2018-01-06.
  3. ^ Peck, G. W. (2002). "Kleitman and combinatorics: a celebration". Discrete Mathematics. Elsevier. 257 (2–3): 193–224. doi:10.1016/S0012-365X(02)00595-2.
  4. ^ "Research Paper - A High Security Log-In Procedure". Retrieved 2013-11-16.
  5. ^ "A high security log-in procedure". doi:10.1145/361082.361089. Retrieved 2013-11-16.
  6. ^ "Authen::Passphrase::VMSPurdy – passphrases with the VMS Purdy polynomial system". CPAN. Retrieved 2009-09-18.
  7. ^ L. Moser and J. Pach, Research problems in discrete geometry, McGill University, Montreal, 1981
  8. ^ A Combinatorial Problem on Polynomials and Rational Functions, György Elekes, Lajos Rónyai, Journal of Combinatorial Theory, Series A, Volume 89, Issue 1, January 2000, Pages 1–20
  9. ^ Distinct distances on two lines, Micha Sharir, Adam Sheffer, József Solymosi, June 4, 2013,