The following publications are possibly variants of this publication:
- Low-Complexity Digit-Serial and Scalable SPB/GPB Multipliers Over Large Binary Extension Fields Using (b, 2)-Way Karatsuba DecompositionChiou-Yng Lee, Chun-Sheng Yang, Bimal Kumar Meher, Pramod Kumar Meher, Jeng-Shyang Pan. tcas, 61-I(11):3115-3124, 2014. [doi]
- Analysis of Systolic Penalties and Design of Efficient Digit-Level Systolic-like Multiplier for Binary Extension FieldsBimal Kumar Meher, Pramod Kumar Meher. cssp, 38(2):774-790, 2019. [doi]
- Subquadratic space complexity digit-serial multiplier over binary extension fields using Toom-Cook algorithmChiou-Yng Lee, Pramod Kumar Meher, Wen-Yo Lee. isicir 2014: 176-179 [doi]
- Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination ApproachChung-Hsin Liu, Chiou-Yng Lee, Pramod Kumar Meher. tcas, 62-I(8):2044-2051, 2015. [doi]
- Novel Bit-Parallel and Digit-Serial Systolic Finite Field Multipliers Over $GF(2^m)$ Based on Reordered Normal BasisJiafeng Xie, Chiou-Yng Lee, Pramod Kumar Meher, Zhi-Hong Mao. tvlsi, 27(9):2119-2130, 2019. [doi]
- Digit Serial-In-Serial-Out Systolic Multiplier for Montogomery's AlgorithmKeon-Jik Lee, Kee-Won Kim, Kee-Young Yoo. ISCApdcs 2001: 500-504
- Digit-serial-in-serial-out systolic multiplier for Montgomery algorithmKeon-Jik Lee, Kee-Won Kim, Kee-Young Yoo. ipl, 82(2):65-71, 2002. [doi]
- Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product ApproachJeng-Shyang Pan, Reza Azarderakhsh, Mehran Mozaffari Kermani, Chiou-Yng Lee, Wen-Yo Lee, Che Wun Chiou, Jim-Min Lin. TC, 63(5):1169-1181, 2014. [doi]