Hugh C. Williams

According to our database1, Hugh C. Williams authored at least 50 papers between 1980 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Influence of Public-Key Cryptography on Mathematics.
Proceedings of the Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman, 2022

2015
Some Arithmetic Properties of Certain Sequences.
J. Integer Seq., 2015

Odd and Even Linear Divisibility Sequences of Order 4.
Integers, 2015

Some primality tests that eluded Lucas.
Des. Codes Cryptogr., 2015

2013
Laudatio in Honour of Professor Dr. Johannes Buchmann on the Occasion of His 60th Birthday.
Proceedings of the Number Theory and Cryptography, 2013

Shorter Compact Representations in Real Quadratic Fields.
Proceedings of the Number Theory and Cryptography, 2013

Some Extensions of the Lucas Functions.
Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

2012
Some Monoapparitic Fourth Order Linear Divisibility Sequences.
Integers, 2012

Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions.
Fundam. Informaticae, 2012

2010
Improved Primality Proving with Eisenstein Pseudocubes.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2008
A New Look at an Old Equation.
Proceedings of the Algorithmic Number Theory, 8th International Symposium, 2008

2007
A fast, rigorous technique for computing the regulator of a real quadratic field.
Math. Comput., 2007

Pseudopowers and primality proving.
Contributions Discret. Math., 2007

2006
An Improved Real-Quadratic-Field-Based Key Exchange Procedure.
J. Cryptol., 2006

Doubly-Focused Enumeration of Pseudosquares and Pseudocubes.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

Numerical Results on Class Groups of Imaginary Quadratic Fields.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2004
Imaginary Cyclic Quartic Fields with Large Minus Class Numbers.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

Pseudocubes and Primality Testing.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Corrigenda and addition to "Computer verification of the Ankeny-Artin-Chowla conjecture for all primes less than 100 000 000 000".
Math. Comput., 2003

New quadratic polynomials with high densities of prime values.
Math. Comput., 2003

New Computations Concerning the Cohen-Lenstra Heuristics.
Exp. Math., 2003

2002
Modular Arithmetic on Elements of Small Norm in Quadratic Fields.
Des. Codes Cryptogr., 2002

2001
Computer verification of the Ankeny-Artin-Chowla Conjecture for all primes less than 100 000 000 000.
Math. Comput., 2001

2000
Explicit primality criteria for (p-1)p<sup>n</sup> - 1.
Math. Comput., 2000

The Size of the Fundamental Solutions of Consecutive Pell Equations.
Exp. Math., 2000

A Note on Shanks's Chains of Primes.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1999
A Problem Concerning a Character Sum.
Exp. Math., 1999

Some Methods for Evaluating the Regulator of a Real Quadratic Function Field.
Exp. Math., 1999

1998
A Problem Concerning a Character Sum - Extended Abstract.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

An Improved Method of Computing the Regulator of a Real Quadratic Function Field.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997
Daniel Shanks (1917-1996).
Math. Comput., 1997

Further tabulation of the Erdös-Selfridge function.
Math. Comput., 1997

1996
Some results on pseudosquares.
Math. Comput., 1996

Results and estimates on pseudopowers.
Math. Comput., 1996

Key-Exchange in Real Quadratic Congruence Function Fields.
Des. Codes Cryptogr., 1996

1995
An Investigation of Bounds for the Regulator of Quadratic Fields.
Exp. Math., 1995

A Public-Key Cryptosystem Utilizing Cyclotomic Fields.
Des. Codes Cryptogr., 1995

1994
A Key-Exchange Protocol Using Real Quadratic Fields.
J. Cryptol., 1994

1991
Some remarks concerning the complexity of computing class groups of quadratic fields.
J. Complex., 1991

Some formulas concerning the fundamental unit of a real quadratic field.
Discret. Math., 1991

1990
Implementation of a Key Exchange Protocol Using Some Real Quadratic Fields.
Proceedings of the Advances in Cryptology, 1990

1989
On the Complexity and Efficiency of a New Key Exchange System.
Proceedings of the Advances in Cryptology, 1989

A Key Exchange System Based on Real Quadratic Fields.
Proceedings of the Advances in Cryptology, 1989

1988
A Key-Exchange System Based on Imaginary Quadratic Fields.
J. Cryptol., 1988

1987
A parallel version of the continued fraction integer factoring algorithm.
J. Supercomput., 1987

On Principal Ideal Testing in Algebraic Number Fields.
J. Symb. Comput., 1987

1985
Some Public-Key Crypto-Functions as Intractable as Factorization.
Cryptologia, 1985

An M³ Public-Key Encryption Scheme.
Proceedings of the Advances in Cryptology, 1985

1983
An Overview of Factoring.
Proceedings of the Advances in Cryptology, 1983

1980
A modification of the RSA public-key encryption procedure (Corresp.).
IEEE Trans. Inf. Theory, 1980


  Loading...