We study for each fixed integer $g \ge 2$, for all primes $\ell $ and p with $\ell \neq p$, finite regular directed graphs associated with the set of equivalence classes of $\ell $-marked principally polarized superspecial abelian varieties of dimension g in characteristic p, and show that the adjacency matrices have real eigenvalues with spectral gaps independent of p. This implies a rapid mixing property of natural random walks on the family of isogeny graphs beyond the elliptic curve case and suggests a potential construction of the Charles–Goren–Lauter-type cryptographic hash functions for abelian varieties. We give explicit lower bounds for the gaps in terms of the Kazhdan constant for the symplectic group when $g \ge 2$. As a byproduct, we also show that the finite regular directed graphs constructed by Jordan and Zaytman also has the same property.

An effective lower bound on the entropy of some explicit quadratic plane Cremona transformations is given. The motivation is that such transformations (Hénon maps, or Feistel ciphers) are used in symmetric key cryptography. Moreover, a hyperbolic plane Cremona transformation g is rigid, in the sense of [5], and under further explicit conditions some power of g is tight.

We give a bound on the primes dividing the denominators of invariants of Picard curves of genus 3 with complex multiplication. Unlike earlier bounds in genus 2 and 3, our bound is based, not on bad reduction of curves, but on a very explicit type of good reduction. This approach simultaneously yields a simplification of the proof and much sharper bounds. In fact, unlike all previous bounds for genus 3, our bound is sharp enough for use in explicit constructions of Picard curves.

This paper introduces ‘hyper-and-elliptic-curve cryptography’, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).

From power series expansions of functions on curves over finite fields, one can obtain sequences with perfect or almost perfect linear complexity profile. It has been suggested by various authors to use such sequences as key streams for stream ciphers. In this work, we show how long parts of such sequences can be computed efficiently from short ones. Such sequences should therefore be considered to be cryptographically weak. Our attack leads in a natural way to a new measure of the complexity of sequences which we call expansion complexity.

We study the elliptic curve discrete logarithm problem over finite extension fields. We show that for any sequences of prime powers (qi)i∈ℕ and natural numbers (ni)i∈ℕ with ni⟶∞ and ni/log (qi)⟶0 for i⟶∞, the elliptic curve discrete logarithm problem restricted to curves over the fields 𝔽qnii can be solved in subexponential expected time (qnii)o(1). We also show that there exists a sequence of prime powers (qi)i∈ℕ such that the problem restricted to curves over 𝔽qi can be solved in an expected time of e𝒪(log (qi)2/3).

In his seminal papers, Koblitz proposed curves for cryptographic use. For fast operations on these curves, these papers also initiated a study of the radix-$\tau $ expansion of integers in the number fields $\mathbb{Q}\left( \sqrt{-3} \right)$ and $\mathbb{Q}\left( \sqrt{-7} \right)$. The (window) nonadjacent form of $\tau $ -expansion of integers in $\mathbb{Q}\left( \sqrt{-7} \right)$ was first investigated by Solinas. For integers in $\mathbb{Q}\left( \sqrt{-3} \right)$, the nonadjacent form and the window nonadjacent form of the $\tau $ -expansion were studied. These are used for efficient point multiplications on Koblitz curves. In this paper, we complete the picture by producing the (window) nonadjacent radix-$\tau $ expansions for integers in all Euclidean imaginary quadratic number fields.