Abstract
The work in this paper discusses the feasibility of a low-resource ECC processor implementation over GF(2m) that supports scalability across a set of standards curves for application in resource constrained environments. A new architecture based on the microcoding technique and targeted to FPGAs is presented for the implementation of a low resource ECC processor design that is scalable to support the 131, 163, 283, 571 bits suite of recommended curves without significant deterioration of the performance. The processor is parameterized for 8, 16, 32-bit data-paths, to quantify the gain in terms of time and area in each case. The implementation results obtained show that the microcode approach results in a lesser area overhead for the ECC point multiplication compared to a full hardware implementation; this makes such approach attractive for numerous applications, where the hardware resources are scarce, as in security in wireless sensor nodes, mobile handsets, and smart cards.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wilkes, M.V.: The Best Way to Design an Automatic Calculating Machine. In: Proc. Manchester Univ. Computer Inaugural Conf., pp. 16–18. Ferranti Ltd. (1951)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
Eslami, Y., Sheikholeslami, A., Gulak, P.G., Masui, S., Mukaida, K.: An area-efficient universal cryptography processor for smart cards. IEEE Transactions on Very Large Scale Integration Systems 14(1), 43–56 (2006)
Eberle, H., Gura, N., Chang-Shantz, S.: A cryptographic processor for arbitrary elliptic curves over GF(2m). In: Proceedings of IEEE International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2003, June 2003, pp. 444–454 (2003)
Leong, P.H.W., Leung, I.K.H.: A microcoded elliptic curve processor using FPGA technology. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 10(5), 550–559 (2002)
Orlando, G., Paar, C.: A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 41–56. Springer, Heidelberg (2000)
NIST.: Recommended elliptic curves for federal government use, http://csrc.nist.gov/encryption/.2000
SEC 2. Standards for Efficient Cryptography Group: Recommended Elliptic Curve Domain Parameters. Version 1.0 (2000)
Comba, P.: Exponentiation cryptosystems on the IBM PC. IBM Systems Journal 29(4), 526–538 (1990)
Lopez, J., Dahab, R.: Fast multiplication on elliptic curves over GF(2m) without precomputation. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 316–327. Springer, Heidelberg (1999)
Hassan, M.N., Benaissa, M.: Embedded Software Design of Scalable Low-Area Elliptic-Curve Cryptography. IEEE Embedded Systems Letters 1(2), 42–45 (2009)
Benaissa, M., Lim, W.M.: Design of flexible GF(2m) elliptic curve cryptography processors. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 14(6), 659–662 (2006)
Shuhua, W., Yuefei, Z.: A Timing-and-Area Tradeoff GF(P) Elliptic Curve Processor Architecture for FPGA. In: IEEE International Conference on Communications, Circuits and Systems, ICCCAS 2005, pp. 1308–1312 (2005)
Rodriguez, F., Saqib, N.A., Diaz-Perez, A., KoÇ, Ç.K.: Cryptographic Algorithms on Reconfigurable Hardware. Springer, Heidelberg (2006)
Vassiliadis, S., Wong, S., Cotofana, S.: Microcode processing positioning and directions. IEEE Micro 23(4), 21–30 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassan, M.N., Benaissa, M. (2010). Efficient Time-Area Scalable ECC Processor Using μ-Coding Technique. In: Hasan, M.A., Helleseth, T. (eds) Arithmetic of Finite Fields. WAIFI 2010. Lecture Notes in Computer Science, vol 6087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13797-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-13797-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13796-9
Online ISBN: 978-3-642-13797-6
eBook Packages: Computer ScienceComputer Science (R0)