Cryptology ePrint Archive: Report 2008/161

Modular polynomials for genus 2

Reinier Broker and Kristin Lauter

Abstract: Modular polynomials are an important tool in many algorithms involving elliptic curves. In this article we generalize this concept to the genus 2 case. We give the theoretical framework describing the genus 2 modular polynomials and discuss how to explicitly compute them.

Category / Keywords: foundations /

Date: received 9 Apr 2008

Contact author: reinierb at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20080414:061812 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]