Ramanujan's class invariants and their use in elliptic curve cryptography

From MaRDI portal
Publication:988264




Abstract: In this paper, we propose the use of Ramanujan class of polynomials for the construction of prime order elliptic curves using the CM-method. We compare (theoretically and experimentally) the efficiency of using this new class against the use of the 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.



Cites Work



Uses Software





This page was built for publication: Ramanujan's class invariants and their use in elliptic curve cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988264)