© The Institution of Engineering and Technology
In this paper, an efficient high-speed architecture of Gaussian normal basis (GNB) multiplierover binary finite field GF(2 m ) is presented. The structure is constructed by using some regular modules for computation of exponentiation by powers of 2 and low-cost blocks for multiplication by normal elements of the binary field. For the powers of 2 exponents, the modules are implemented by some simple cyclic shifts in the normal basis representation. As a result, the multiplier has a simple structure with a low critical path delay. The efficiency of the proposed multiplier is examined in terms of area and time complexity based on its implementation on Virtex-4 field programmable gate array family and also its application specific integrated circuit design in 180 nm complementary metal–oxide–semiconductor technology. Comparison results with other structures of the GNB multiplier verify that the proposed architecture has better performance in terms of speed and hardware utilisation.
References
-
-
1)
-
35. Adikari, J., Barsoum, A., Hasan, M.A., et al: ‘Improved area-time tradeoffs for field multiplication using optimal normal bases’, IEEE Trans. Comput., 2013, 62, (1), pp. 193–199 (doi: 10.1109/TC.2011.198).
-
2)
-
14. Wang, Z., Wang, X., Fan, S.: ‘Concurrent error detection architectures for field multiplication using Gaussian normal basis’. Proc. of Information Security, Practice and Experience (ISPEC), 2010, pp. 96–109.
-
3)
-
10. Reyhani-Masoleh, A., Hasan, M.A.: ‘Efficient digit-serial normal basis multipliers over binary extension fields’, ACM Trans. Embedded Comput. Syst., 2004, 3, (3), pp. 575–592 (doi: 10.1145/1015047.1015053).
-
4)
-
28. Tujillo-Olaya, V., Velasco-Medina, J.: ‘Hardware architectures for elliptic curve cryptoprocessors using polynomial and Gaussian normal basis over GF(2233)’, Trans. Comput. Sci. XI, 2010, 6480, pp. 79–103 (doi: 10.1007/978-3-642-17697-5_5).
-
5)
-
20. Azarderakhsh, R., MozaffariKermani, M., Bayat-Sarmadi, S., et al: ‘Systolic Gaussian normal basis multiplier architectures suitable for high-performance applications’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2014, 23, (9), pp. 1969–1972 (doi: 10.1109/TVLSI.2014.2345774).
-
6)
-
2. Horng, J.S., Jou, I.C., Lee, C.Y.: ‘On complexity of normal basis multiplier using modified Booth's algorithm’. Proc. Seventh WSEAS Int. Conf. on Applied Informatics and Communications, Athens, Greece, 24–26 August 2007, pp. 12–17.
-
7)
-
17. Chiou, C.W., Chang, C.C., Lee, C.Y., et al: ‘Concurrent error detection and correction in Gaussian normal basis multiplier over GF(2m)’, IEEE Trans. Comput., 2009, 58, (6), pp. 851–857 (doi: 10.1109/TC.2008.226).
-
8)
-
9)
-
3. Ash, D.W., Blake, I.F., Vanstone, S.A.: ‘Low complexity normal bases’, Discrete Appl. Math., 1989, 25, (3), pp. 191–210 (doi: 10.1016/0166-218X(89)90001-2).
-
10)
-
18. Kwon, S.: ‘A low complexity and a low latency bit parallel systolic multiplier over GF(2m) using an optimal normal basis of type II’. Proc. 16th IEEE Symp. Computer Arithmetic, June 2003, pp. 196–202.
-
11)
-
34. Juliato, M., Araujo, G., Lopez, J., et al: ‘A custom instruction approach for hardware and software implementations of finite field arithmetic over F2163 using Gaussian normal bases’, J. VLSI Signal Process., 2007, 47, (1), pp. 59–76 (doi: 10.1007/s11265-006-0015-8).
-
12)
-
15. Wun Chiou, C., Lin, J.M., Li, Y.K., et al: ‘Pipeline design of bit-parallel Gaussian normal basis multiplier over GF(2m)’, Adv. Intell. Syst. Comput., 2014, 238, pp. 369–377 (doi: 10.1007/978-3-319-01796-9_40).
-
13)
-
8. Horng, J.S., Jou, I.C., Lee, C.Y.: ‘Low-complexity multiplexer-based normal basis multiplier over GF(2m)’, J. Zhejiang Univ. Sci. A, 2009, 10, (6), pp. 834–842 (doi: 10.1631/jzus.A0820398).
-
14)
-
21. Sukcho, Y., Yeon Choi, J.: ‘Anew word-parallel bit-serial normal basis multiplier over GF(2m)’, Int. J. Control Autom., 2013, 6, (3), pp. 209–216.
-
15)
-
12. Wun Chiou, C., Lee, C.Y., Yeh, Y.C.: ‘Sequential type-I optimal normal basis multiplier and multiplicative inverse in GF(2m)’, Tamkang J. Sci. Eng., 2010, 13, (4), pp. 423–432.
-
16)
-
3. Chiou, C.W., Chang, H.W., Liang, W.Y., et al: ‘Low-complexity Gaussian normal basis multiplier over GF(2m)’, IET Inf. Secur., 2012, 6, (4), pp. 310–317 (doi: 10.1049/iet-ifs.2012.0110).
-
17)
-
18)
-
33. Wu, H., Hasan, M.A., Blake, I.F., et al: ‘Finite field multiplier using redundant representation’, IEEE Trans. Comput., 2002, 51, (11), pp. 1306–1316 (doi: 10.1109/TC.2002.1047755).
-
19)
-
13. Reyhani-Masoleh, A., Hasan, M.A.: ‘Low complexity word-level sequential normal basis multipliers’, IEEE Trans. Comput., 2005, 54, (2), pp. 98–110 (doi: 10.1109/TC.2005.29).
-
20)
-
11. Koc, C.K., Sunar, B.: ‘An efficient optimal normal basis type II multiplier over GF(2m)’, IEEE Trans. Comput., 2001, 50, (1), pp. 83–87 (doi: 10.1109/12.902754).
-
21)
-
6. Reyhani-Masoleh, A.: ‘Efficient algorithms and architectures for field multiplication using Gaussian normal bases’, IEEE Trans. Comput., 2006, 55, (1), pp. 34–47 (doi: 10.1109/TC.2006.10).
-
22)
-
29. Hosseinzadeh-Namin, A., Wu, H., Ahmadi, M.: ‘A word-level finite field multiplier using normal basis’, IEEE Trans. Comput., 2011, 60, (6), pp. 890–895 (doi: 10.1109/TC.2010.235).
-
23)
-
22. Lee, C.Y.: ‘Concurrent error detection architectures for Gaussian normal basis multiplication over GF(2m)’, Integr., VLSI J., 2010, 43, (1), pp. 113–123 (doi: 10.1016/j.vlsi.2009.07.002).
-
24)
-
19. Lee, C., Chang, P.: ‘Digit-serial Gaussian normal basis multiplier over GF(2m) using Toeplitz matrix-approach’. Proc. Int. Conf. Computational Intelligence and Software Engineering (CiSE), 2009, pp. 1–4.
-
25)
-
9. Lee, C.-Y., Chiou, C.W.: ‘Scalable Gaussian normal basis multipliers over GF(2m) using Hankel matrix-vector representation’, Signal Process. Syst., 2012, 69, (2), pp. 197–211 (doi: 10.1007/s11265-011-0654-2).
-
26)
-
5. Azarderakhsh, R., Reyhani-Masoleh, A.: ‘A Modified low complexity digit-level Gaussian normal basis multiplier’. Proc. Third Int. Workshop Arithmetic of Finite Fields (WAIFI), June 2010, pp. 25–40.
-
27)
-
6. Bayat-Saramdi, S., Hasan, M.A.: ‘Concurrent error detection in finite-field arithmetic operations using pipelined and systolic architectures’, IEEE Trans. Comput., 2009, 58, (11), pp. 1553–1567 (doi: 10.1109/TC.2009.62).
-
28)
-
24. Pan, J.S., Lee, C.Y., Li, Y.: ‘Subquadratic space complexity Gaussian normal basis multipliers over GF(2m) based on Dickson-Karatsuba decomposition’, IET Circuits Devices Syst.., 2015, 9, (5), pp. 336–342 (doi: 10.1049/iet-cds.2014.0276).
-
29)
-
32. Hosseinzadeh-Namin, A., Wu, H., Ahmadi, M.: ‘High speed word-parallel bit-serial normal basis finite field multiplier and its FPGA implementation’. Thirty-Ninth Asilomar Conf. on Signals, Systems and Computers, 28 October–1 November 2005, pp. 1338–1341.
-
30)
-
5. Wang, Z., Fan, S.: ‘Efficient montgomery-based semi-systolic multiplier for even-type GNB of GF(2m)’, IEEE Trans. Comput., 2012, 61, (3), pp. 415–419 (doi: 10.1109/TC.2010.272).
-
31)
-
9. Chuang, T.P., Wun Chiou, C., Lin, S.S., et al: ‘Fault-tolerant Gaussian normal basis multiplier over GF(2m)’, IET Inf. Secur., 2012, 6, (3), pp. 157–170 (doi: 10.1049/iet-ifs.2011.0190).
-
32)
-
31. Novotny, M., Schmidt, J.: ‘General digit-serial normal basis multiplier with distributed overlap’. 10th Euromicro Conf. on Digital System Design Architectures, Methods and Tools, 29–31 August 2007, pp. 94–101.
-
33)
-
1. Hankerson, D., Menezes, A., Vanstone, S.: ‘Guide to elliptic curve cryptography’ (Springer-Verlag, New York, 2004, 1st edn.).
-
34)
-
30. Grabbe, C., Bednara, M., Teich, J., et al: ‘FPGA designs of parallel high performance GF(2233) multipliers’. Proc. Int. Symp. on Circuits and Systems, 25–28 May 2003, pp. 268–271.
-
35)
-
7. Azarderakhsh, R., Reyhani-Masoleh, A.: ‘Low-complexity multiplier architectures for single and hybrid-double multiplications in Gaussian normal bases’, IEEE Trans. Comput., 2013, 62, (4), pp. 744–757 (doi: 10.1109/TC.2012.22).
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds.2015.0337
Related content
content/journals/10.1049/iet-cds.2015.0337
pub_keyword,iet_inspecKeyword,pub_concept
6
6