George B. Purdy
|George Barry Purdy|
|Residence||Cincinnati, Ohio, United States|
|Fields||Mathematics and computer science|
|Institutions||University of Cincinnati
Texas A&M University
|Alma mater||University of Illinois|
|Doctoral advisor||Paul T. Bateman|
|Known for||Combinatorial geometry
He has an Erdős number of one.
George Barry Purdy is a mathematician and computer scientist who specializes in combinatorial geometry and number theory. He is the namesake of the Purdy polynomial, used in operating systems (e.g., OpenVMS) to hash user passwords. OpenVMS uses a 64-bit version, based on a 64-bit prime, that is starting to be considered insecure, but there is no theoretical limit to the size of the prime used, and it is rumored that there are classified military versions that are extremely secure.
Purdy received his Ph.D. from the University of Illinois at Urbana–Champaign in 1972, under the supervision of Paul T. Bateman. He was on the faculty in the mathematics department at Texas A&M University for 11 years, and has been a professor of computer science at the University of Cincinnati for 26 years.
- 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.
- George Barry Purdy at the Mathematics Genealogy Project
- "Research Paper - A High Security Log-In Procedure". Passwordresearch.com. Retrieved 2013-11-16.
- "A high security log-in procedure". Dl.acm.org. doi:10.1145/361082.361089. Retrieved 2013-11-16.
- "Authen::Passphrase::VMSPurdy – passphrases with the VMS Purdy polynomial system". CPAN. Retrieved 2009-09-18.
- 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.