The mathematics of elliptic curves has been studied since ancient times. These mathematical structures have found applications in varied fields. More recently, there has been a growing interest in applying these structures to cryptography. Various such applications have been proposed. Elliptic curve based cryptographic algorithms have been shown to provide greater security with shorter key sizes than the conventional RSA based cryptosystems, making them more memory e cient and less processor intensive. One of the fundamental requirements of all such elliptic curve cryptographic algorithms is that the order of the group of points satisfying the elliptic curve meet a certain set of requirements. However, finding the group order is not a trivial task. There are numerous special cases of elliptic curves where determining the group order is trivial. This thesis however, deals with the study of general point counting algorithms and their performances, which are applicable to all the curves. Possible improvements to the algorithms are provided where possible.

Library of Congress Subject Headings

Curves, Elliptic; Cryptography--Data processing

Publication Date


Document Type


Department, Program, or Center

Computer Science (GCCIS)


Homan, Christopher

Advisor/Committee Member

Carithers, Warren


Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA567.2.E44 S86 2008


RIT – Main Campus