(Enter summary)
Abstract: Aimed at computer scientists, this how to describes a method (with detailed algorithms) that allows to compute the factors of a class polynomial over the genus field. Though we only consider polynomials having real factors over the genus field, it is not difficult to adapt the method so that it works when these factors are complex. Keywords: complex multiplication, genus field, class polynomial, factoring. (Update)
Active bibliography (related documents): More All
0.1: Efficient Computation of Fourier Series and Singular Moduli with.. - Baier (2001)
(Correct)
0.1: Recent Developments in Primality Proving - Mihailescu
(Correct)
0.1: Generating Elliptic Curves of Prime Order - Erkay Savas Thomas
(Correct)
Similar documents based on text:
6.0: Unknown -
(Correct)
BibTeX entry: (Update)
@misc{ martin-factoring,
author = "Marcel Martin",
title = "Factoring Class Polynomials over the Genus Field",
url = "citeseer.ist.psu.edu/martin06factoring.html" }
Citations (may not include all citations):
352
A Course in Computational Algebraic Number Theory (context) - COHEN - 1996
81
Standard Specifications for Public Key Cryptography (context) - Draft
63
Elliptic curves and primality proving
- ATKIN, MORAIN - 1993
10
Advanced Number Theory (context) - COHN - 1980
9
Primes of the form x (context) - COX - 1989
1
Constructing elliptic curves over finite fields using double.. (context) - ENGE, SCHERTZ - 2004
1
The complexity of class polynomial computations via floating.. (context) - ENGE - 2006
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006)
(Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006)
(Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC