Welcome to the resource topic for 2011/295
Title:
Counting Points on Genus 2 Curves with Real Multiplication
Authors: P. Gaudry, D. Kohel, B. Smith
Abstract:We present an accelerated Schoof-type point-counting algorithm for curves of genus 2 equipped with an efficiently computable real multiplication endomorphism. Our new algorithm reduces the complexity of genus 2 point counting over a finite field GF(q) of large characteristic from \sO(\log^8 q) to \sO(\log^5 q). Using our algorithm we compute a 256-bit prime-order Jacobian, suitable for cryptographic applications, and also the order of a 1024-bit Jacobian.
ePrint: https://eprint.iacr.org/2011/295
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .