| Hugh C. Williams | |
| Birth Date: | 23 July 1943 |
| Birth Place: | London, Ontario, Canada |
| Occupation: | Mathematician |
| Fields: | |
| Workplaces: | |
| Education: | University of Waterloo |
| Thesis Title: | A Generalization of the Lucas Functions |
| Thesis1 Url: | and |
| Thesis2 Url: | )--> |
| Thesis Year: | 1969 |
| Doctoral Advisors: |
|
| Doctoral Students: | Renate Scheidler |
Hugh Cowie Williams (born 23 July 1943) is a Canadian mathematician. He deals with number theory and cryptography.
Williams studied mathematics at the University of Waterloo (bachelor's degree 1966, master's degree 1967), where he received his doctorate in 1969 in computer science under Ronald C. Mullin and Ralph Gordon Stanton (A generalization of the Lucas functions). He was a post-doctoral student at York University.
In 1970 he became assistant professor at the University of Manitoba, where in 1972 he attained associate professor status and professor in 1979.
In 2001 he became a professor at the University of Calgary, and professor emeritus since 2004. Since 2001 he has held the "iCore Chair" in Algorithmic Number Theory and Cryptography.
Together with Rei Safavi-Naini he heads the Institute for Security, Privacy and Information Assurance (ISPIA) - formerly Centre for Information Security and Cryptography - at Calgary.[1] Between 1998 and 2001 he was an adjunct professor at the University of Waterloo. He was a visiting scholar at the University of Bordeaux, at Macquarie University and at University of Leiden. From 1978 to January 2007 he was associate editor of the journal Mathematics of Computation.
Among other things Williams dealt with primality tests;[2] Williams primes were named for him. He developed custom hardware for number-theoretical calculations, for example the MSSU in 1995.[3] In cryptography, he developed in 1994 with Renate Scheidler and Johannes Buchmann a method of public key cryptography based on real quadratic number fields.[4] Williams developed algorithms for calculating invariants of algebraic number fields such as class numbers and regulators.
Williams deals with math history and wrote a book about the history of primality tests. In it, he showed among other things that Édouard Lucas worked shortly before his early death on a test similar to today's elliptic curve method. He reconstructed the method that Fortuné Landry used in 1880 (at the age of 82) to factor the sixth Fermat number (a 20-digit number).[5]
Together with Jeffrey Shallit and François Morain he discovered a forgotten mechanical number sieve created by Eugène Olivier Carissan, the first such device from the beginning of the 20th century (1912), and described it in detail.[6]
N2
F6