A reconfigurable processor for high speed point multiplication in elliptic curves

International Journal of Embedded Systems

Volumn 1, Issue 3-4, 2005, Pages 237-249

  Saqib, Nazar A ^a   Rodríguez Henriquez, Francisco ^b   Díaz Pérez, Arturo ^b  

^a NATIONAL UNIVERSITY OF SCIENCES AND TECHNOLOGY   (Pakistan)

^b DEPARTAMENTO DE FÍSICA   (Mexico)

Author keywords

elliptic curve cryptography; finite field arithmetic; reconfigurable hardware

Indexed keywords

EID: 33750738116     PISSN: 17411068     EISSN: 17411076     Source Type: Journal    
DOI: 10.1504/ijes.2005.009953     Document Type: Article

References (24)

1. Bach, E. and Shallit, J. (1996) Algorithmic Number Theory, Volume I: Efficient Algorithms, Kluwer Academic Publishers, Boston, MA.
2. Bednara, M., Daldrup, M., Shokrollahi, J., Teich, J. and von zur Gathen, J. (2002) ‘Reconfigurable implementation of elliptic curve crypto algorithms’, Proc. of The 9th Reconfigurable Architectures Workshop (RAW-02), Fort Lauderdale, Florida, USA, April, pp.157–164.
3. Chudnovsky, D.V. and Chudnovsky, G.V. (1986) ‘Sequences of numbers generated by addition in formal groups and new primality and factorization tests’, Advances in Applied Math., Vol. 7, pp.385–434.
4. Ernst, M., Jung, M, Madlener, F. et al. (2003) ‘A reconfigurable system on chip implementation for elliptic curve cryptography over GF(2n)’, Cryptographic Hardware and Embedded Systems – CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, 13–15 August, 2002, Revised Papers, Vol. 2523, pp.381–399.
5. Goodman, J. and Chandrakasan, A. (2001) ‘An energy-efficient reconfigurability public-key cryptography processor’, IEEE Journal of Solid-State Circuits, Vol. 36, No. 11, November, pp.1808–1820.
6. Gura, N., Shantz, S., Eberle, H. et al. (2003) ‘An end-to-end systems approach to elliptic curve cryptography’, Cryptographic Hardware and Embedded Systems – CHES 2002, 4th International Workshop, Redwood Shores, CA, USA, 13–15 August, Revised Papers, Vol. 2523, pp.349–365.
7. Hankerson, D., Lopez-Hernandez, J. and Menezes, A. (2000) ‘Software implementation of elliptic curve cryptography over binary fields’, Cryptographic Hardware and Embedded Systems – CHES 2000, Second International Workshop, Proceedings, Worcester, MA, USA, August 17–18, Vol. 1965, pp.1–24.
8. Hasan, M.A., Wang, M.Z. and Bhargava, V.K. (1993) ‘A modified Massey-Omura parallel multiplier for a class of finite fields’, IEEE Transactions on Computers, Vol. 42, No. 10, November, pp.1278–1280.
9. Leong, P.H.W. and Leung, I.K.H. (2002) ‘A microcoded elliptic curve processor using FPGA technology’, IEEE Transactions on VLSI Systems, Vol. 10, No. 5, October, pp.550–559.
10. m) without precomputation’, Cryptographic Hardware and Embedded Systems, First International Workshop, CHES ‘99, Worcester, MA, USA, 12–13 August, Proceedings, Vol. 1717, pp.316–327.
11. Menezes, A.J., van Oorschot, P.C. and Vanstone, S.A. (1996) Handbook of Applied Cryptography, CRC Press, Boca Raton, Florida.
12. Morii, M., Kasahara, M. and Whiting, D.L. (1989) ‘Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields’, IEEE Transactions on Information Theory, Vol. 35, No. 6, pp.1177–1183.
13. Orlando, G. and Paar, C. (2000) ‘A high-performance reconfigurable elliptic curve processor for GF(2m)’, Cryptographic Hardware and Embedded Systems – CHES 2000, Second International Workshop Proceedings, Worcester, MA, USA, 17–18 August, Vol. 1965, August, pp.41–56.
14. Orlando, G. and Paar, C. (2001) ‘A scalable GF(p) elliptic curve processor architecture for programmable hardware’, Cryptographic Hardware and Embedded Systems – CHES 2001, Third International Workshop, Proceedings, Paris, France, 14–16 May, Vol. 2162, pp.348–363.
15. m)’, Proceedings of the IASTED International Conference on Computer Science and Technology, Cancún, México, 19–21 th May, pp.405–410.
16. m)’, Microprocessor and Microsystems, special Issue on FPGAs: Applications and Designs, Vol. 28, Nos. 5–6, pp.329–339.
17. m)’, Proc. of The 11th Reconfigurable Architectures Workshop IEEE Computer Society, (RAW-04. Santa Fe, New Mexico): April, p.144.
18. Satoh, A. and Takano, K. (2003) ‘A scalable dual-field elliptic curve cryptographic processor’, IEEE Transactions on Computers, Vol. 52, No. 4, April, pp.449–460.
19. Schroeppel, R., Beaver, C., Gonzales, R., Miller, R. and Draelos, T. (2003) ‘A low-power design for an elliptic curve digital signature chip’, Cryptographic Hardware and Embedded Systems – CHES 2002, 4th International Workshop, Revised Papers, Redwood Shores, CA, USA, 13–15 August, Vol. 2523, pp.366–380.
20. Smart, N. (2001) ‘The hessian form of an elliptic curve’, Cryptographic Hardware and Embedded Systems – CHES 2001, Third International Workshop, Paris, France, 14–16 Proceedings, May, Vol. 2162, pp.118–125.
21. Smart, N. and Westwood, E. (2003) ‘Point multiplication on ordinary elliptic curves over fields of characteristic three’, Applicable Algebra in Engineering, Communication and Computing, Vol. 13, pp.485–497.
22. Sunar, B. and Koç, C.K. (1999) ‘Mastrovito multiplier for all trinomials’, IEEE Transactions on Computers, Vol. 48, No. 5, May, pp.522–527.
23. von zur Gathen, J. and Nocker, M. (1999) ‘Computing special powers in finite fields: extended abstract’, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, ACM Press, pp.83–90.
24. Wu, H. and Hasan, M.A. (1998) ‘Low complexity bit-parallel multipliers for a class of finite fields’, IEEE Transactions on Computers, Vol. 47, No. 8, August, pp.883–887.