Abstract
Conventional Elliptic Curve (EC) cryptosystems are subjected to side channel attacks because of their lack of unifiedness. On the other hand, unified cryptosystems based on Edwards curves have been found to be slow. The present paper proposes the first VLSI design of binary Huff curves, which also lead to unified scalar multiplication. Several optimized architectural features have been developed to utilize the FPGA resources better, and yet lead to a faster circuit. Experimental results have been presented on the standard NIST curves, and on state-of-the-art GF(2233) to show that the design is significantly faster than other unified EC cryptosystems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ansari, B., Hasan, M.A.: High Performance Architecture of Elliptic Curve Scalar Multiplication. Tech. rep., Department of Electrical and Computer Engineering, University of Waterloo (2006)
Bernstein, D.J., Lange, T., Farashahi, R.R.: Binary edwards curves. Cryptology ePrint Archive, Report 2008/171 (2008), http://eprint.iacr.org/
Chatterjee, A., Sengupta, I.: Fpga implementation of binary edwards curve using ternary representation. In: GLSVLSI 2011: Proceedings of the 21st ACM Great Lakes Symposium on VLSI. ACM, Lausanne (2011)
Chelton, W.N., Benaissa, M.: Fast Elliptic Curve Cryptography on FPGA. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 16(2), 198–205 (2008)
Devigne, J., Joye, M.: Binary Huff Curves. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 340–355. Springer, Heidelberg (2011)
Hoffstein, J.: An introduction to mathematical cryptography. Springer (2009)
Izu, T., Takagi, T.: Exceptional Procedure Attackon Elliptic Curve Cryptosystems. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 224–239. Springer, Heidelberg (2002)
Joye, M., Tibouchi, M., Vergnaud, D.: Huff’s Model for Elliptic Curves. In: Hanrot, G., Morain, F., Thomé, E. (eds.) ANTS-IX. LNCS, vol. 6197, pp. 234–250. Springer, Heidelberg (2010)
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)
Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Pu, Q., Huang, J.: A Microcoded Elliptic Curve Processor for GF(2m) Using FPGA Technology. In: 2006 International Conference on Communications, Circuits and Systems Proceedings, vol. 4, pp. 2771–2775 (June 2006)
Rebeiro, C., Mukhopadhyay, D.: High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 376–388. Springer, Heidelberg (2008)
Rosing, M.: Implementing Elliptic Curve Cryptography. Manning Publications Co., Sound View Ct. 3B Greenwich (1998)
Saqib, N.A., RodrÃiguez-HenrÃquez, F., Diaz-Perez, A.: A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication Over GF(2m). In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chatterjee, A., Sengupta, I. (2012). High-Speed Unified Elliptic Curve Cryptosystem on FPGAs Using Binary Huff Curves. In: Rahaman, H., Chattopadhyay, S., Chattopadhyay, S. (eds) Progress in VLSI Design and Test. Lecture Notes in Computer Science, vol 7373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31494-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-31494-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31493-3
Online ISBN: 978-3-642-31494-0
eBook Packages: Computer ScienceComputer Science (R0)