RGMU: A High-flexibility and Low-cost Reconfigurable Galois Field Multiplication Unit Design Approach for CGRCA
Article No.: 38, Pages 1 - 24
Abstract
Finite field multiplication is a non-linear transformation operator that appears in the majority of symmetric cryptographic algorithms. Numerous specified finite field multiplication units have been proposed as a fundamental module in the coarse-grained reconfigurable cipher logic array to support more cryptographic algorithms; however, it will introduce low flexibility and high overhead, resulting in reduced performance of the coarse-grained reconfigurable cipher logic array. In this article, a high-flexibility and low-cost reconfigurable Galois field multiplication unit (RGMU) is proposed to balance the tradeoffs between the function, delay, and area. All the finite field multiplication operations, including maximum distance separable matrix multiplication, parallel update of Fibonacci linear feedback shift register, parallel update of Galois linear feedback shift register, and composite field multiplication, are analyzed and two basic operation components are abstracted. Further, a reconfigurable finite field multiplication computational model is established to demonstrate the efficacy of reconfigurable units and guide the design of RGMU with high performance. Finally, the overall architecture of RGMU and two multiplication circuits are introduced. Experimental results show that the RGMU can not only reduce the hardware overhead and power consumption but also has the unique advantage of satisfying all the finite field multiplication operations in symmetric cryptography algorithms.
References
[1]
Dai Zi-bin, Li Wei, and Chen Tao. 2008. Design and implementation of a high-speed reconfigurable feedback shift register. In Proceedings of the 4th IEEE International Conference on Circuits and Systems for Communications. 338–342. DOI:
[2]
E. Berlekamp. 1982. Bit-serial reed-solomon encoders. IEEE Trans. Inf. Theory 28, 6 (1982), 869–874. DOI:
[3]
Zhang Xue-ying, Dai Zi-bin, and Li Wei. 2009. Research and Implementation of Reconfigurable Multiplier over Galois Field Targeted at Stream Cipher. Springer, Berlin, 34. DOI:
[4]
Y. Su, B. L. Yang, and C. Yang. 2020. High-flexible hardware and instruction of composite galois field multiplication targeted at symmetric crypto processor. J. Amb. Intell. Human. Comput. 9, 2 (2020), 1-17. DOI:
[5]
LI Wei and Yang Xuan. 2015. A parallel and reconfigurable united architecture for fibonacci and galois LFSR. In Proceedings of the 7th International Conference on Intelligent Human-Machine Systems and Cybernetics. 203–206. DOI:
[6]
J. Samanta, R. Sultana, and J. Bhaumik. 2014. FPGA based modified karatsuba multiplier. In Proceedings of the International Conference on VLSI Signal Processing (ICVSP ’14).
[7]
C. C. Wang, T. K. Troung, and H. M. Shao. 1985. VLSI architectures for computing multiplications and inverses in GF(2m). IEEE Trans. Comput. 34, 8 (1985), 709–717. DOI:
[8]
Gustavo Banegas, Ricardo Custodio, and Daniel Panario. 2019. A new class of irreducible pentanomials for polynomial-based multipliers in binary fields. J. Cryptogr. Eng. 9, 4 (2019), 359–373.
[9]
A. Hariri and A. Reyhani-Masoleh. 2008. Digit-serial structures for the shifted polynomial basis multiplication over binary extension fields. In Proceedings of the International Workshop on Arithmetic of Finite Fields (WAIFI ’08).
[10]
SR. Pillutla and L. Boppana. 2019. An area-efficient bit-serial sequential polynomial basis finite field GF (2(m)) multiplier. Int. J. Electr. Commun. 114. DOI:
[11]
A. Reyhani-masoleh and M. A. Hasan. 2002. A new construction of massey-omura parallel multiplier over GF(2/sup m/). IEEE Comput. Soc. 5 (2002). DOI:
[12]
A. Cilardo. 2009. Efficient bit-parallel GF(2^m) multiplier for a large class of irreducible pentanomials. IEEE Trans. Comput. 58, 7 (2009), 1001-1008. DOI:
[13]
H. Wu. 2008. Bit-parallel polynomial basis multiplier for new classes of finite fields. IEEE Trans. Comput. 57, 8 (2008), 1023–1031. DOI:
[14]
C. Y. Lee, E. H. Lu, and L. F. Sun. 2001. Low-complexity bit-parallel systolic architecture for computing AB/sup 2/+C in a class of finite field GF(2/sup m/). IEEE Trans. Circ. Syst. 48, 5 (2001), 519–523.
[15]
Meher Pramod and Kumar. 2015. Low-latency high-throughput systolic multipliers over GF(2(m)) for NIST recommended pentanomials. IEEE Trans. Circ. Syst. 62, 3 (2015), 881–890.
[16]
S. K. Jain. 1998. Efficient semi-systolic architectures for finite-field arithmetic. IEEE VLSI Syst. 6, 1 (1998), 101–113.
[17]
A. Reyhani-Masoleh. 2006. Efficient algorithms and architectures for field multiplication using Gaussian normal bases. IEEE Trans. Comput. 55, 1 (2006), 34–47. DOI:
[18]
Yuan Dan-shou and Rong Meng-tian. 2006. Reconfigurable and fast finite field multiplier architecture. J. Electr. Inf. Technol. 28, 4 (2006), 717–720.
[19]
Paris Kitsos, George Theodoridis, and Odysseas Koufopavlou. 2003. An efficient reconfigurable multiplier architecture for galois field GF(2m). Microelectr. J. 34, 10 (2003), 975–980. DOI:
[20]
Qu Tong-zhou, Dai Zi-bin, Chen Lin, and Liu Yan-jiang. 2023. A hybrid granularity parallel arithmetical unit for stream cipher. J. Electr. Inf. Technol. 45, 1 (2023), 78–86. DOI:
[21]
Qin Xiao-yi, Wang Han-sheng, and Zeng Lie-guang. 2003. Paralleling techniques for linear and non-linear register systems. Acta Electr. Sin. 31, 3 (2003), 406–410.
[22]
A. Rudra, P. K. Dubey, and C. S. Jutla. 2001. Efficient rijndael encryption implementation with composite field arithmetic. In Proceedings of the 3rd International Workshop on Cryptographic Hardware and Embedded Systems, 171–184.
[23]
Li Wei, Dai Zi-bin, and Chen Tao. 2008. Low-power 32-bit multiplier based on leapfrog wallace tree. Comput. Eng. 34, 17 (2008), 229–231. DOI:
[24]
L. Nan, X. Zeng, and Z. Wang. 2017. Research of a reconfigurable coarse-grained cryptographic processing unit based on different operation similar structure. In Proceedings of the IEEE 12th International Conference on ASIC, 191–194. DOI:
[25]
S. A. Jassim and A. K. Farhan. 2021. A survey on stream ciphers for constrained environments. In Proceedings of the 1st Babylon International Conference on Information Technology and Science (BICITS ’21), 228–233. DOI:
[26]
H. Fan and M. A. Hasan. 2006. Fast bit parallel-shifted polynomial basis multipliers in GF(2n). IEEE Trans. Circ. Syst. 53, 12 (2006), 2606–2615. DOI:
[27]
B. Sunar, E. Savas, and C. K. Koc. 2003. Constructing composite field representations for efficient conversion. IEEE Trans. Comput. 52, 11 (2003), 1391–1398. DOI:
[28]
L.-m. Nan, X.-y. Zeng, W. Li, C. Lin, Y.-r. Du, and Z.-b. Dai. 2018. Research of special instructions for composite field multiplications in symmetric cryptographic algorithms. In Proceedings of the 14th IEEE International Conference on Solid-State and Integrated Circuit Technology (ICSICT ’18), 1–4. DOI:
[29]
M. Hutter, J. Grossschadl, and G. A. Kamendje. 2003. A versatile and scalable digit-serial/parallel multiplier architecture for finite fields GF(2/sup m/). In Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC ’03).
[30]
M. Heidarpur and M. Mirhassani. 2021. An efficient and high-speed overlap-free karatsuba-based finite-field multiplier for FGPA implementation. IEEE Trans. VLSI Syst. 29, 4 (2021), 667–676. DOI:
[31]
R. -J. Chen, J. -W. Fan, and C. -H. Liao. 2014. Reconfigurable galois field multiplier. In Proceedings of the International Symposium on Biometrics and Security Technologies (ISBAST ’14). 112–115. DOI:
[32]
N. Iliev, J. E. Stine, and N. Jachimiec. 2004. Parallel programmable finite field GF (2/sup m/) multipliers. In Proceedings of the IEEE Computer Society Annual Symposium on VLSI. 299–302. DOI:
[33]
M. Goresky and A. M. Klapper. 2002. Fibonacci and galois representations of feedback-with-carry shift registers. IEEE Trans. Inf. Theory (2002). DOI:
Index Terms
- RGMU: A High-flexibility and Low-cost Reconfigurable Galois Field Multiplication Unit Design Approach for CGRCA
Recommendations
On the design of reconfigurable multipliers for integer and Galois field multiplication
Multiplication is a vital function for practically any DSP system. Some common DSP algorithms require different multiplication types, specifically integer or Galois Field (GF) multiplication. Since both functions share similarities in their structures, ...
GF(2m) Multiplication and Division Over the Dual Basis
In this paper an algorithm for GF(2m) multiplication/division is presented and a new, more generalized definition of duality is proposed. From these the bit-serial Berlekamp multiplier is derived and shown to be a specific case of a more general class ...
Architecture for dense matrix multiplication on a high-performance reconfigurable system
SBCCI '09: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the DunesThe recent evolution of the programmable logic devices, such as FPGAs (Field Programmable Gate Array), associated with the growing demand for performance improvements in scientific computing applications, has attracted the attention of supercomputers ...
Comments
Information & Contributors
Information
Published In
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Journal Family
Publication History
Published: 15 February 2024
Online AM: 09 January 2024
Accepted: 30 December 2023
Revised: 31 August 2023
Received: 27 February 2023
Published in TODAES Volume 29, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Natural Science Foundation of China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 139Total Downloads
- Downloads (Last 12 months)73
- Downloads (Last 6 weeks)10
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in