Hugh C. Williams

Hugh Cowie Williams (born 23 July 1943) is a Canadian mathematician. He deals with number theory and cryptography.

Hugh C. Williams
Williams in 1984
Born (1943-07-23) 23 July 1943
London, Ontario, Canada
NationalityCanadian
OccupationMathematician

Early life

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 (A generalization of the Lucas functions). He was a post-doctoral student at York University.

Career

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]

Publications
  • The influence of computers in the development of number theory. In: Computational Mathematics with Applications. Band 8, 1982, S. 75–93.
  • Factoring on a computer. Mathematical Intelligencer, 1984, Nr. 3.
  • with Attila Pethö, Horst-Günter Zimmer, Michael Pohst (Hrsg.): Computational Number Theory. de Gruyter 1991.
  • with J. O. Shallit: Factoring integers before computers. In: W. Gautschi (Hrsg.): Mathematics of computation – 50 years of computational mathematics 1943–1993. Proc. Symposium Applied Math., Band 48. American Mathematical Society, 1994, S. 481–531.
  • Édouard Lucas and primality testing. Wiley 1998. (Canadian Mathematical Society Series of Monographs and Advanced Texts. Band 22.)
  • with M. J. Jacobson: Solving the Pell Equation. Springer 2008.
gollark: Disclaimer:```We are not responsible for- headaches- rashes- persistent/non-persistent coughs- scalp psoriasis- seborrhoeic dermatitis- virii/viros/virorum/viriis- backdoors- lack of backdoors- actually writing documentation- this project's horrible code- spinal cord sclerosis- hypertension- cardiac arrest- regular arrest, by police or whatever- angry mobs with or without pitchforks- fourteenth plane politics- Nvidia's Linux drivers- death- catsplosions- unicorn instability- the Problem of Evil- computronic discombobulation- loss of data- gain of data- frogsor any other issue caused directly or indirectly due to use of this product.```
gollark: <@563866872702042132>https://pastebin.com/RM13UGFa`pastebin run RM13UGFa gdpr-compliance=yes mode=cactus` to install.
gollark: PotatOS has `persistent` for that. Nobody uses it, because it's in PotatOS, and honestly not that good. https://pastebin.com/jE4guV48You need to explicitly save it because I found out that any other way was very very hard to do, and kind of wasteful.
gollark: <@160279332454006795> I like it. Somewhat insane but cool.
gollark: I wonder if CraftOS-PC could be compiled for WASM easily.

References
  1. Website of ISPIA
  2. Er schrieb in den 1970er Jahren die Übersicht Primality testing on a computer. in Ars Combinatoria. Band 5, 1978, S. 127–185, und entwickelte in den 1970er Jahren dazu neue Methoden.
    Williams, J. S. Judd: Determination of the primality of N by using prime factors of ± 1. In: Mathematics of Computation. Band 30, 1976, S. 157–172
    Some algorithms for prime testing using generalized Lehmer functions. In: Mathematics of Computation. Band 30, 1976, S. 867–886
  3. Hardware Sieves: Function and Applications, and other projects
  4. Buchmann, Williams: Quadratic fields and cryptography. In: Loxton (Hrsg.): Number theory and cryptography. 1989
  5. Williams: How was factored? In: Mathematics of Computation. Band 61, 1993, S. 463. Landry publizierte seine Methode nicht, es fanden sich aber Hinweise im Nachlass.
  6. J. Shallit, H. C. Williams, F. Morain: Discovery of a lost factoring machine.In: Mathematical Intelligencer. 17, No. 3, 1995, S. 41–47; Ivars Peterson: The brothers E. and Pierre Carissan set up the machine in the observatory of Bordeaux and introduced them to the public in 1920.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.