A timing-and-area tradeoff GF(p) elliptic curve processor architecture for FPGA

2005 International Conference on Communications, Circuits and Systems - Proceedings

Volumn 2, Issue , 2005, Pages 1308-1312

  Shuhua, Wu ^a   Yuefei, Zhu ^a  

^a INFORMATION ENGINEERING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITION; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; CONTROL EQUIPMENT; PROGRAM PROCESSORS;

ELLIPTIC CURVES; FINITE STATE MACHINE; POINT MULTIPLICATION; PRIME INTEGER;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 29844444327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. N.Koblitz: Elliptic Curve Cryptosystems. Mathematics of Computation. 48(1987), 203-209.
2. V.Miller: Use of elliptic curves in cryptography. In Advances in Cryptology: proceedings of Crypto'85, Lecture Notes in Computer Science, vol.218. New York: Springer-Verlag(1986), 416-426.
3. 155. IEEE Journal on Selected areas in Communications, vol. 11,pp804-813, June 1993.
4. M. Rosner: Elliptic curve cryptosystems on reconfigurable hardware. Master's thesis, ECE Dept., Worcester Polytech-nic Institute, Worcester, USA, May 1998.
5. L. Gao, S.Shrivastava, and G. Sobelman: Elliptic curve scalar multiplier design using FPGAs. In Workshop on Cryptographic Hardware and Embedded Systems(CHES '99) (C. Koc and C. Paar, eds.), vol. LNCS 1717, Springer-Verlag, August 1999.
6. 155 for elliptic curve crypto-systems. In The 1998 IEEE Asia Pacific Conference on Circuits and Systems. pp.647-650,November 1998.
7. K. Leung, K. Ma, W.Wong, and P. Leong: FPGA implementation of a microcoded elliptic curve cryptographic processor. In Eight Annual IEEE Symposuium on Field Programmable Custom Computing Machines, FCCM '00, (Napa Valley, California, USA). 2000.
8. m). In Workshop on Cryptographic Hardware and Embedded Systems - CHES 2000,vol. LNCS 1965, (Worcester. Massachusetts, USA), Springer-Verlag, August 2000.
9. G.Orlando and C. Paar: A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware. http://www.crypto.ruhr-unibochum.de/ Publikationen/texte/ecpp.ches.pdf.
10. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone: Handbook of Applied Cryptography. CRC Press, 1997.
11. I. Blake, G. Seroussi, and N. Smart: Elliptic Curves in Cryptography. Cambridge,UK: Cambridge University Press, first ed., 1999.
12. H. Cohen, A. Miyaji, and T. Ono.: Efficient elliptic curve exponentiation. In Advances in Cryptology - Proceedings of ICIS'97, (LNCS 1514), pages 51 - 65. Springer-Verlag, 1998.
13. H. Cohen, A. Miyaji, and T. Ono.: Efficient elliptic curve exponentiation using mixed coordinates. In Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science, 1334 (1997), Springer-Verlag, 1998, pages 51 -65.
14. P. Montgomery: Modular multiplication without trial division. In Mathematics of Computation, vol. 44, pp. 519-521, April 1985.
15. J. Solinas: Improved algorithms for arithmetic on anomalous binary curves. Technical Report CORR- 46, Dept. of C&O, University of Waterloo, 1999.
16. Srinivas Devadas and A. Richard Newton: Decomposition and Factorization of Sequential Finite State Machines. In IEEE Transactions on Computer-aided Design, Vol.8, No.11, November 1989, pages 1206-1217.
17. H.Orup: Simplifying quotient determination in high-radix modular multiplication. In Proceedings 12th Symposium on Computer Arithmetic, pp. 193-9, 1995.
18. P. Kocher: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Proceedings of CRYPTO '96 (N.Koblitz. ed.), Lecture Notes in Computer Science, vol. 1109, Springer-Verlag, 1996, pp. 104-113.
19. C. K. Koc and Chr. Paar: Power analysis attacks of modular exponentiation in smartcards. In Proceedings of CHES '99, Lecture Notes in Computer Science, vol. 1717, Springer-Verlag, 1999, pp. 144-157.