9 citations · 13 across the 6 of their papers we have counts for
6 papers
Preimages for Zémor's Cayley hash function
Eilidh McKemmie, Amol Srivastava
In 1991, Zémor proposed a hash function which provides data security using the difficulty of writing a given matrix as a product of generator matrices. Tillich and Zémor subsequent…
Low-genus primitive monodromy groups with a nonunique minimal normal subgroup
Spencer Gerhardt, Eilidh McKemmie, Danny Neftin
Let be a Riemann surface, and let be an indecomposable (branched) covering of genus and degree whose monodromy group has more than one m…
Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era
María Isabel González Vasco, Delaram Kahrobaei, Eilidh McKemmie
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this…
Galois groups of random additive polynomials
Lior Bary-Soroker, Alexei Entin, Eilidh McKemmie
We study the distribution of the Galois group of a random -additive polynomial over a rational function field: For a power of a prime , let $f=X^{q^n}+a_{n-1}X^{q^{n-1}}+…
On the probability of generating invariably a finite simple group
Daniele Garzoni, Eilidh McKemmie
Let be a finite simple group. In this paper we consider the existence of small subsets of with the property that, if is chosen uniformly at random, then with…
Invariable generation of finite classical groups
Eilidh McKemmie
A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show tha…