## Abbreviations  
The following abbreviations are used in this manuscript:  
IoTInternet of Things  
GFGalois field  
PEProcessing element  
ECCElliptic Curve Cryptography  
DGDependency graph  
ATArea-time  
AOPAll-One Polynomial  
PBPolynomial basis  
NBNormal basis  
DBDual basis  
ESPEqually Spaced Polynomials  
* (21) [PERSON] Low complexity systolic Montgomery multiplication over finite fields gf (\(2^{m}\)). _J. Korea Soc. Digit. Ind. Inf. Manag._**2022**, _18_, 1-9.
* (22) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficient low-latency multiplication architecture for nist trinomials with risc-v integration. In _IEEE Transactions on Circuits and Systems II: Express Briefs;_ IEEE: New York, NY, USA, 2024.
* (23) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] High-performance unified modular multiplication algorithm and hardware architecture over gf(\(2^{m}\)). _Integration_**2024**, _96_, 102124. [CrossRef]
* (24) [PERSON]; [PERSON]; [PERSON] A dual basis bit serial systolic multiplier for gf(\(2^{m}\)). _Integration_**1995**, _18_, 139-149. [CrossRef]
* (25) [PERSON]; [PERSON] A semi-systolic montgomery multiplier over gf(\(2^{m}\)). _IEICE Electron. Express_**2015**, _12_, 1-6. [CrossRef]
* (26) [PERSON]; [PERSON] Efficient systolic modular multiplier/squarer for fast exponentiation over gf(\(2^{m}\)). _IEICE Electron. Express_**2015**, _12_, 1-6. [CrossRef]
* (27) [PERSON]; [PERSON]; [PERSON] An efficient reconfigurable multiplier architecture for galois field gf(\(2^{m}\)). _Microelectron. J._**2003**, _34_, 975-980. [CrossRef]
* (28) [PERSON]; [PERSON]; [PERSON]; [PERSON] Improved throughput bit-serial multiplier for gf(\(2^{m}\)) fields. _Integration_**2009**, _42_, 371-384. [CrossRef]
* (29) [PERSON]; [PERSON] Digit-serial systolic multiplier for finite fields gf(\(2^{m}\)). _IEEE Proc. Comput. Digital Tech._**1998**, _145_, 143-148. [CrossRef]
* (30) [PERSON]; [PERSON]; [PERSON] A versatile and scalable digit-serial/parallel multiplier architecture for finite fields gf(\(2^{m}\)). In Proceedings of the 2003 4 th International Conference on InformationTechnology: Coding and Computing (ITTC2003), Las Vegas, NV, USA, 28-30 April 2003; pp. 692-700.
* (31) [PERSON]; [PERSON] Low-energy digit serial/parallel finite field multipliers. _J. Vlsi Signal Process. Syst._**1998**, _19_, 149-166. [CrossRef]
* (32) [PERSON]; [PERSON]; [PERSON] A digit-serial multiplier for finite field \(GF(2^{m})\). _IEEE Trans. Very Large Scale Integr. (VLSI) Sys._**2005**, _13_, 476-483.
* (33) [PERSON]; [PERSON] Digit-serial structures for the shifted polynomial basis multiplication over binary extension fields. In Proceedings of the LNCS Intl Workshop Arithmetic of Finite Fields (WAIFI), Siena, Italy, 6-9 July 2008; pp. 103-116.
* (34) [PERSON] _Algorithms and Parallel Computers_; [PERSON]: New York, NY, USA, 2011.
* (35) [PERSON]; [PERSON]; [PERSON] New systolic array architecture for finite field division. _IEICE Electron. Express_**2018**, _15_, 1-11. [CrossRef]
* (36) [PERSON] Scalable digit-serial processor array architecture for finite field division. _Microelectron. J._**2019**, _85_, 83-91. [CrossRef]
* (37) [PERSON] Low-space bit-serial systolic array architecture for interleaved multiplication over gf (\(2^{m}\)). _IET Comput. Digit. Tech._**2021**, _15_, 223-229. [CrossRef]
* (38) [PERSON] A new bit-serial architecture for field multiplication using polynomial bases. In Proceedings of the 7 th International Workshop Cryptographic Hardware Embedded Systems (CHES 2008), Washington, DC, USA, 10-13 August 2008; pp. 314-330.  
**Disclaimer/Publisher's Note:** The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.