High primes and misdemeanours Book

	Streets at Alberta
	Hugh Cowie Williams
	Constructing elliptic curves with a known number of points over a prime field	1
	On a generalization of the radix representation - a survey	19
	Multiplicative structure of values of the Euler function	29
	Congruences and exponential sums with the Euler function	49
	On the existence of cyclic difference sets with small parameters	61
	Doubly focused enumeration of locally square polynomial values	69
	Cubic reciprocity and explicit primality tests for [actual symbol not reproducible] 3[superscript k] [actual symbol not reproducible] 1	77
	Algorithms for finding almost irreducible and almost primitive trinomials	91
	Commentary on Lucas' test	103
	Number field cryptography	111
	Reconfigurable computing machines and their applications in computational number theory	123
	Heuristics for class numbers of prime-power real cyclotomic fields	149
	Counting A[subscript 4] and S[subscript 4] number fields with given resolvent cubic	159
	On a conjecture of Feit and Thompson	169
	Amicable pairs, a survey	179
	On the research contributions of Hugh C. Williams	197
	Hilbert modular fourfolds of arithmetic genus one	217
	Values of ternary recurrence sequences and torsion on certain curves arising from the work of Hugh Williams	227
	Divisibility of exponents of class groups of pure cubic number fields	237
	New conjectures and results for small cycles of the discrete logarithm	245
	Hyperelliptic curves and cryptography	255
	Remarks on S. Chowla's hypothesis implying that L(s, [chi]) > 0 for s > 0 and for real characters [chi]	283
	On the computation of cube roots modulo p	293
	Jeepers, creepers, ...	305
	Algebraic tori in cryptography	317
	An analysis of the generalized binary GCD algorithm	327
	An elliptic curve trapdoor system	341
	Periodic continued fractions and elliptic curves	353
	The Cunningham project	367
	Extensions and improvements for the CM method for genus two	379
App	Advice to referees of submissions to high primes and misdemeanours	391