Browse > Article

Design of a ECC arithmetic engine for Digital Transmission Contents Protection (DTCP)  

Kim Eui seek (세인시스템)
Jeong Yong jin (광운대학교)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.30, no.3C, 2005 , pp. 176-184 More about this Journal
Abstract
In this paper, we implemented an Elliptic Curve Cryptography(ECC) processor for Digital Transmission Contents Protection (DTCP), which is a standard for protecting various digital contents in the network. Unlikely to other applications, DTCP uses ECC algorithm which is defined over GF(p), where p is a 160-bit prime integer. The core arithmetic operation of ECC is a scalar multiplication, and it involves large amount of very long integer modular multiplications and additions. In this paper, the modular multiplier was designed using the well-known Montgomery algorithm which was implemented with CSA(Carry-save Adder) and 4-level CLA(Carry-lookahead Adder). Our new ECC processor has been synthesized using Samsung 0.18 m CMOS standard cell library, and the maximum operation frequency was estimated 98 MHz, with the size about 65,000 gates. The resulting performance was 29.6 kbps, that is, it took 5.4 msec to process a 160-bit data frame. We assure that this performance is enough to be used for digital signature, encryption and decryption, and key exchanges in real time environments.
Keywords
ECC; DTCP; Scalar Multiplier; Modular Multiplier; Montgomery Multiplier;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Berna Ors, L. Batina, B. Preneel and J. Vandewalle, 'Hardware Implementation of an Elliptic Curve Processor over GF(p),' Proceedings of the Application-Specific Systems, Architectures, and Processor, IEEE 2003
2 Israel Koren, Computer Arithmetic Algorithms (2nd edition), 2002
3 J. Kim, Y. Kim and Y. Jeong, 'Implementation of a pipelined Scalar Multiplier using Extended Euclid Algorithm for Elliptic Curve Cryptography(ECC),' 한국정보보호학회, pp. 17-30. Oct. 2001
4 Certicom Whitepaper, 'The Elliptic Curve Cryptosystem for Smart Cards,' http:// www.certicom.com, May, 1998
5 IEEE P1363a/D5(Draft Version 5). Standard Specifications for Public Key Cryptography : Additional Techniques, August 16 2000
6 E.Savas, A. F. Tenca and C. K. Koc, 'A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and $GF(2^m)$,' Workshop on Cryptographic Hardware and Embedded Systems(CHES), pp. 281-282. Aug. 2000
7 DTCP Specification, '5C Digital Transmission Content Protection Specification Volume 1(Information Version),' July, 2000