Design and Implementation of ECC Algorithm Unit Based on ONB over GF(2 n )
暂无分享,去创建一个
Based on optimal normal basis in GF(2n),a high speed serial-parallel elliptic curve multiplier is proposed in the paper,through introduction of operation rules in GF(2n),elliptic curves and point operation rules,with emphasis on the discussion of the ECC chip speed and hardware resource consuming,which is induced by different field partitions.The rate of point multiply is about 981 per second after FPGA validation.
[1] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.
[2] T. Itoh,et al. A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..
[3] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[4] Gordon B. Agnew,et al. An Implementation of Elliptic Curve Cryptosystems Over F2155 , 1993, IEEE J. Sel. Areas Commun..