论文信息 - An architecture for elliptic curve cryptograph computation

An architecture for elliptic curve cryptograph computation

It is known that several public key cryptosystems such as RSAs, ElGamals and elliptic curve cryptosystems [1], and also elliptic curve cryptosystems require smaller keys and more efficient operation than RSAs and ElGamals for same security. For example, elliptic curve cryptosystems with 160 bits key have same security as RSAs and ElGamals with 1024 bits key have. We focus elliptic curve cryptosystems and propose an architecture of computation unit for an elliptic curve cryptosystem with small hardware.

Masaaki Shirase | Yasushi Hibino | Masaaki Shirase | Y. Hibino

[1] S. Sanyal. Computer Arithmetic Systems , 1995 .

[2] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[3] Amos R. Omondi,et al. Computer arithmetic systems - algorithms, architecture and implementation , 1994, Prentice Hall International series in computer science.

[4] Neal Koblitz,et al. a course in number theory , 1987 .

[5] Christof Paar,et al. Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms , 1998, CRYPTO.

[6] N. Koblitz. A Course in Number Theory and Cryptography , 1987 .

[7] Kunio Kobayashi,et al. Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic , 1999, EUROCRYPT.

[8] H. E. Rose. A course in number theory , 1988 .