Sarah Chisholm

Learn More
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on(More)
  • Jennifer Mun, Young Park, Bjorn Poonen, Matt Baker, Jennifer S Balakrishnan, Manjul Bhargava +30 others
  • 2014
Faltings' theorem states that curves of genus g > 2 have finitely many rational points. Using the ideas of Faltings, Mumford, Parshin and Raynaud, one obtains an upper bound on the upper bound on the number of rational points [Szp85], XI, §2, but this bound is too large to be used in any reasonable sense. In 1985, Coleman showed [Col85] that Chabauty's(More)
  • 1