Hugh C. Williams

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:92/3922 · DBLP profile ↗

← Back

16ranked-venue papers

4as first author

0since 2021 · last 2015

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 11 · 3 first-authorTheory of computation · 4 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security

8 papers

Cryptographic protocols and secure computation · 72% Cryptographic primitives and cryptanalysis · 28%

Topics — the 10 heaviest of 11, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Cryptographic protocols and secure computation key exchange	0.1	4	2006	An Improved Real-Quadratic-Field-Based Key Exchange Procedure · J. Cryptol. 2006 A Key-Exchange Protocol Using Real Quadratic Fields · J. Cryptol. 1994 A Key Exchange System Based on Real Quadratic Fields · CRYPTO 1989
Cryptographic primitives and cryptanalysis public-key cryptography	0.0	3	1988	Some Public Key Crypto-Functions as Intractable as Factorization · CRYPTO 1984 A modification of the RSA public-key encryption procedure (Corresp.) · IEEE Trans. Inf. Theory 1980 A Key-Exchange System Based on Imaginary Quadratic Fields · J. Cryptol. 1988
Cryptographic primitives and cryptanalysis cryptographic assumptions	0.0	2	1984	Some Public Key Crypto-Functions as Intractable as Factorization · CRYPTO 1984 An Overview of Factoring · CRYPTO 1983
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption multi-recipient encryption	0.0	1	1985	An M³ Public-Key Encryption Scheme · CRYPTO 1985
Cryptographic primitives and cryptanalysis › public-key cryptography public-key encryption	0.0	1	1985	An M³ Public-Key Encryption Scheme · CRYPTO 1985
Cryptographic primitives and cryptanalysis › public-key cryptography factoring-based cryptography	0.0	1	1984	Some Public Key Crypto-Functions as Intractable as Factorization · CRYPTO 1984
Cryptographic primitives and cryptanalysis › cryptographic assumptions factoring	0.0	1	1983	An Overview of Factoring · CRYPTO 1983
Cryptographic primitives and cryptanalysis › public-key cryptography digital signatures	0.0	1	1980	A modification of the RSA public-key encryption procedure (Corresp.) · IEEE Trans. Inf. Theory 1980
Cryptographic primitives and cryptanalysis integer factorization	0.0	1	1980	A modification of the RSA public-key encryption procedure (Corresp.) · IEEE Trans. Inf. Theory 1980
Cryptographic primitives and cryptanalysis › public-key cryptography RSA cryptosystem	0.0	1	1980	A modification of the RSA public-key encryption procedure (Corresp.) · IEEE Trans. Inf. Theory 1980

Methods — techniques the papers use, named apart from their topics

imaginary quadratic field arithmetic · 0.0reduction · 0.0factoring algorithms · 0.0

Year	Publication	Venue	Position
2015	Some primality tests that eluded Lucas Eric L. Roettger, Hugh C. Williams, Richard K. Guy	Des. Codes Cryptogr.	2
2012	Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions abstract One of the goals of public-key cryptography is to securely exchange a key by use of a public channel without the users previously communicating with one another. In 1976 W. Diffie and M. Hellman had an idea how to do this by exploiting mathematically Eric L. Roettger, Hugh C. Williams	Fundam. Informaticae	2
2006	An Improved Real-Quadratic-Field-Based Key Exchange Procedure Michael J. Jacobson Jr., Renate Scheidler, Hugh C. Williams	J. Cryptol.	3
2002	Modular Arithmetic on Elements of Small Norm in Quadratic Fields Michael J. Jacobson Jr., Hugh C. Williams	Des. Codes Cryptogr.	2
1996	Key-Exchange in Real Quadratic Congruence Function Fields Renate Scheidler, Andreas Stein, Hugh C. Williams	Des. Codes Cryptogr.	3
1995	A Public-Key Cryptosystem Utilizing Cyclotomic Fields Renate Scheidler, Hugh C. Williams	Des. Codes Cryptogr.	2
1994	A Key-Exchange Protocol Using Real Quadratic Fields Renate Scheidler, Johannes Buchmann 0001, Hugh C. Williams	J. Cryptol.	3
1991	Some remarks concerning the complexity of computing class groups of quadratic fields Johannes Buchmann 0001, Hugh C. Williams	J. Complex.	2
1989	A Key Exchange System Based on Real Quadratic Fields Johannes Buchmann 0001, Hugh C. Williams	CRYPTO	2
1988	A Key-Exchange System Based on Imaginary Quadratic Fields Johannes Buchmann 0001, Hugh C. Williams	J. Cryptol.	2
1987	On Principal Ideal Testing in Algebraic Number Fields Johannes Buchmann 0001, Hugh C. Williams	J. Symb. Comput.	2
1987	A parallel version of the continued fraction integer factoring algorithm Marvin C. Wunderlich, Hugh C. Williams	J. Supercomput.	2
1985	An M³ Public-Key Encryption Scheme Hugh C. Williams	CRYPTO	1
1984	Some Public Key Crypto-Functions as Intractable as Factorization Hugh C. Williams	CRYPTO	1
1983	An Overview of Factoring Hugh C. Williams	CRYPTO	1
1980	A modification of the RSA public-key encryption procedure (Corresp.) abstract The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integerRused as the modulus can be factored. It my however be possible to break this system without factoringR. A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, thenRcan be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme. Hugh C. Williams	IEEE Trans. Inf. Theory	1