Results

**1 - 4**of**4**### Computing polynomials of the Ramanujan tn class invariants

- 52(4) (2009) 583–597; MR MR2567152

"... ..."

(Show Context)
### Introducing Ramanujan’s Class Polynomials in the Generation of Prime Order Elliptic Curves

, 804

"... Complex Multiplication (CM) method is a frequently used method for the generation of prime order elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this method is the computation of the roots of a special type of class polynomials, called Hilbert polynomials. These p ..."

Abstract
- Add to MetaCart

(Show Context)
Complex Multiplication (CM) method is a frequently used method for the generation of prime order elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this method is the computation of the roots of a special type of class polynomials, called Hilbert polynomials. These polynonials are uniquely determined by the CM discriminant D. The disadvantage of these polynomials is that they have huge coefficients and thus they need high precision arithmetic for their construction. Alternatively, Weber polynomials can be used in the CM method. These polynomials have much smaller coefficients and their roots can be easily transformed to the roots of the corresponding Hilbert polynomials. However, in the case of prime order elliptic curves, the degree of Weber polynomials is three times larger than the degree of the corresponding Hilbert polynomials and for this reason the calculation of their roots involves computations in the extension field F p 3. Recently, two other classes of polynomials, denoted by MD,l(x) and MD,p1,p2(x) respectively, were introduced which can also be used in the generation of prime order elliptic curves. The advantage of these polynomials is that their degree is equal to the degree of the Hilbert polynomials and thus computations over the extension field can be avoided. In this paper, we propose the use of a new class of polynomials. We will call them Ramanujan polynomials named after Srinivasa Ramanujan who was the first to compute them for few values of D. We explicitly describe the algorithm for the construction of the new polynomials, show that their degree is equal to the degree of the corresponding Hilbert polynomials and give the necessary transformation of their roots (to the roots of the corresponding Hilbert polynomials). Moreover, we compare (theoretically and experimentally) the efficiency of using this new class against the use of the aforementioned Weber, MD,l(x) and MD,p1,p2(x) polynomials and show that they clearly outweigh all of them in the generation of prime order elliptic curves.

### CONSTRUCTING CLASS INVARIANTS

, 2014

"... Shimura reciprocity law allows us to verify that a modular function gives rise to a class invariant. Here we present a new method based on Shimura reciprocity that allows us not only to verify but to find new class invariants from a modular function of level N. ..."

Abstract
- Add to MetaCart

Shimura reciprocity law allows us to verify that a modular function gives rise to a class invariant. Here we present a new method based on Shimura reciprocity that allows us not only to verify but to find new class invariants from a modular function of level N.

### RAMANUJAN INVARIANTS FOR DISCRIMINANTS CONGRUENT TO 5 (mod 24)

, 2011

"... this paper we compute the minimal polynomials of Ramanujan values 27t−12n for dis-criminants D ≡ 5 (mod 24). Our method is based on Shimura Reciprocity Law as which was made computationally explicit by Gee and Stevenhagen in [Generating class fields ..."

Abstract
- Add to MetaCart

this paper we compute the minimal polynomials of Ramanujan values 27t−12n for dis-criminants D ≡ 5 (mod 24). Our method is based on Shimura Reciprocity Law as which was made computationally explicit by Gee and Stevenhagen in [Generating class fields