Efficient Implementation Of SEA Algorithm

In the implementation of the Elliptic Curve Cryptosystem, we first have to selecta secure elliptic curve. The main step of choosing a secure elliptic curve is thecomputation of the order of a randomly selected el1iptic curve. SEA algorithm isAnown as an efficient method to couflt the orders of el1iptic curves. In this thesis, theefficient implementation of SEA algorithm is studied. ChaPter 2 made some progressin the computation of big number Algorithm 4.9 made some local improvements onMorain AlgorithIn. In the section 6 of ChaPter 4, we provide an efficient scheme ofthe combination of the methods in the SEA algorithm. At last, we made somediscussion on how to speed up the selection of a secure elliptic curve. Ourimplementation of SEA algorithm and seIection of the secure elliptic curve over GF(p)are efficient.