Average liar count for degree-2 Frobenius pseudoprimes

In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham, generalizing arguments of Erd\H{o}s and Pomerance, and Monier. These bounds are provided for both Jacobi symbol plus and minus cases, providing evidence for the existence of several challenge pseudoprimes.Comment: 19 pages, published in Mathematics of Computation, revised version fixes typos and made a minor correction to the proof of Lemma 18 (result remains unchanged

Constructing Carmichael numbers through improved subset-product algorithms

We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with k prime factors for every k between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes p with the property that p-1 divides a highly composite \Lambda.Comment: Table 1 fixed; previously the last 30 digits and number of digits were calculated incorrectl

Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function