High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie WilliamsHugh C. Williams, A. J. Van Der Poorten, Andreas Stein American Mathematical Soc. - 392 Seiten This volume consists of a selection of papers based on presentations made at the international conference on number theory held in honor of Hugh Williams' sixtieth birthday. The papers address topics in the areas of computational and explicit number theory and its applications. The material is suitable for graduate students and researchers interested in number theory. |
Inhalt
| 1 | |
On a Generalization of the Radix Representationa Survey | 19 |
Multiplicative Structure of Values of the Euler Function 29 | 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 h3k+1 | 77 |
Algorithms for Finding Almost Irreducible and Almost | 91 |
On the Research Contributions of Hugh C Williams | 197 |
Hilbert Modular Fourfolds of Arithmetic Genus One | 217 |
Divisibility of Exponents of Class Groups of Pure Cubic Number Fields | 237 |
Hyperelliptic Curves and Cryptography | 255 |
Remarks on S Chowlas Hypothesis Implying that Ls x 0 | 283 |
Jeepers Creepers | 305 |
Algebraic Tori in Cryptography | 317 |
An Elliptic Curve Trapdoor System Extended Abstract | 341 |
Commentary on Lucas Test | 103 |
Number Field Cryptography | 111 |
Heuristics for Class Numbers of PrimePower Real Cyclotomic Fields | 149 |
On a Conjecture of Feit and Thompson | 169 |
The Cunningham Project | 367 |
Advice to Referees of Submissions | 391 |
Häufige Begriffe und Wortgruppen
algebraic algorithm amicable pairs applications arithmetic arithmetic genus bits Borho bound class group class number CM field coefficients Comp complex conjecture continued fraction expansion cryptography Cryptology cryptosystems cubic cyclic D. H. Lehmer D₁ defined degree denote difference sets discrete logarithm problem discriminant ECDLP element elliptic curve equation Euler example exponent finite fields FPGAs function field genus given H. C. Williams HCDLP HD(X heuristics Hugh hyperelliptic curves ideal class imaginary quadratic irreducible isogeny isomorphism classes Jacobian Jc(k Lecture Notes Lehmer Lemma log log Lucas m₁ Math Mathematical Society Mathematics Subject Classification Mersenne method modulo multiplication number fields Number Theory positive integer primality testing prime divisors prime factors primitive trinomials proof pseudosquares quadratic fields random real quadratic residue root RPPR Section sequence sieve solutions solve square step Theorem values y-smooth
Beliebte Passagen
Seite 365 - Center for Education and Research in Information Assurance and Security, and Department of Computer Sciences, Purdue University, West Lafayette, IN 47907-1398, USA, sswScerias . purdue . edu Lynne H.