Abstract
Recently, a shifted polynomial basis is a variation of polynomial basis representation. Such kind basis provides better performance in designing bit-parallel and subquadratic space complexity multipliers over binary extension fields. In this paper, we study a new shifted polynomial basis multiplication algorithm to implement a hybrid digit-serial multiplier. The proposed algorithm effectively integrates classic schoolbook multiplication, Karatsuba multiplication algorithms to reduce computational complexity, and the modular multiplication with the shifted polynomial basis reduction. We note that, comparably, the proposed architecture achieves lower computation time and higher bit-throughput compared to the best known digit-serial multipliers. Our proposed multipliers can be modular, regular, and suitable for very-large-scale integration (VLSI) implementations. The proposed digit-serial architecture makes the hardware implementations of cryptographic systems more high-performance, and are thus much suitable for efficient applications such as the elliptic curve cryptography (ECC) and pairing computation.
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
Digital Signature Standard, National Institute of Standards and Technology, 186-2 (January 2000)
IEEE Std 1363-2000, IEEE Standard Specifications for Public-Key Cryptography (January 2000)
Adikari, J., Dimitrov, V., Cintra, R.: A New algorithm for double scalar multiplication over Koblitz curves. In: IEEE Intl Symp. Circuits and Systems (ISCAS 2011), pp. 709–712 (2011)
Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. SIAM Journal on Computing 32(3), 586–615 (2003)
Aranha, D.F., Beuchat, J.-L., Detrey, J., Estibals, N.: Optimal eta pairing on supersingular genus-2 binary hyperelliptic curves. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 98–115. Springer, Heidelberg (2012)
Beuchat, J.-L., Detrey, J., Estibals, N., Okamoto, E., Rodriguez-Henriquez, F.: Fast architectures for the T η pairing over smallcharacteristic supersingular elliptic curves. computers. IEEE Trans. Computers 60(2), 266–281 (2011)
Fan, H., Dai, Y.: Fast bit-parallel GF(2n ) multiplier for all trinomials. IEEE Trans. Computers 54(4), 485–490 (2005)
Fan, Hasan, M.: Fast bit parallel shifted polynomial basis multipliers in GF(2n). IEEE Trans. Circuits and Systems I: Regular Papers 53(12), 2606–2615 (2006)
Fan, Hasan, M.: Subquadratic computational complexity schemes for extended binary field multiplication using optimal normal bases. IEEE Trans. Computers 56(10), 1435 (2007)
Park, S.-M., Chang, K.-Y.: Fast bit-parallel shifted polynomial basis multiplier using weakly dual basis over GF(2m). IEEE Trans. Very Large Scale Integration (VLSI) Systems 19(12), 2317–2321 (2011)
Negre, C.: Efficient parallel multiplier in shifted polynomial basis. Journal of Systems Architecture 53(2-3), 109–116 (2007)
Morales-Sandoval, M., Feregrino-Uribe, C., Kitsos, P.: Bit-serial and digit-serial GF(2m) Montgomery multipliers using linear feedback shift registers. IET Computers and Digital Techniques 5(2), 86–94 (2011)
Kumar, S., Wollinger, T., Paar, C.: Optimum digit serial GF(2m) multipliers for curve-based cryptography. IEEE Trans. Computers 55(10), 1306–1311 (2006)
Hariri, A., Reyhani-Masoleh, A.: Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields. In: von zur Gathen, J., Imaña, J.L., Koç, Ç.K. (eds.) WAIFI 2008. LNCS, vol. 5130, pp. 103–116. Springer, Heidelberg (2008)
Talapatra, S., Rahaman, H., Mathew, J.: Low complexity digit serial systolic Montgomery multipliers for special class of GF(2m). IEEE Trans. Very Large Scale Integration (VLSI) Systems 18(5), 487–852 (2010)
Hariri, A., Reyhani-Masoleh, A.: Digit-level semi-systolic and systolic structures for the shifted polynomial basis multiplication over binary extension fields. IEEE Trans. VLSI, 8 Transaction 19(11), 2125–2129 (2011)
Paar, C.: A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Trans. Computers 45(7), 856–861 (1996)
Montgomery, P.: Five, six, and seven-term karatsuba-like formulae. IEEE Trans. Computers 54(3), 362–369 (2005)
Fan, H., Gu, M., Sun, J., Lam, K.-Y.: Obtaining more karatsuba-like formulae over the binary field. IET Information Security 6(1), 434–437 (2012)
Zhou, G., Michalik, H., Hinsenkamp, L.: Complexity analysis and efficient implementations of bit parallel finite field multipliers based on Karatsuba-Ofman algorithm on FPGAs. IEEE Trans. Very Large Scale Integr. 18(7), 1057–1066 (2010)
Juliano, D.P., Lima, B., Wang, Q.: A karatsuba-based algorithm for polynomial multiplication in chebyshev form. To appear in IEEE Trans. Computers (2013)
Fan, H., Sun, J., Gu, M., Lam, K.-Y.: Overlap-free karatsuba-ofman polynomial multiplication algorithms. In: 3rd International Conference on Design and Technology of Integrated Systems in Nanoscale Era, DTIS 2008, vol. 4(1), pp. 8–14 (2010)
Lee, C.-Y.: Digit-serial Gaussian normal basis multiplier over GF(2m) using Toeplitz matrix-approach. In: The 20th VLSI Design/CAD Symposium 2009, Hualien, Taiwan, August 4-7, pp. 1–4 (2009)
Nangate standard cell library, http://www.si2.org/openeda.si2.org/projects/nangatelib/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lee, CY., Lee, WY., Chiou, C.W., Pan, JS., Ni, CH. (2014). Hybrid Digit-Serial Multiplier for Shifted Polynomial Basis of GF(2m). In: Pan, JS., Krömer, P., Snášel, V. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-319-01796-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-01796-9_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01795-2
Online ISBN: 978-3-319-01796-9
eBook Packages: EngineeringEngineering (R0)