Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials

DOI10.1109/TCSI.2017.2677962zbMath1468.94861OpenAlexW2602052759MaRDI QIDQ5007244

Jiafeng Xie, Bo Zeng, Zhi-Hong Mao, Mingui Sun, Yuecheng Li, Pramod Kumar Meher

Publication date: 26 August 2021

Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcsi.2017.2677962

Mathematics Subject Classification ID

Analytic circuit theory (94C05)

This page was built for publication: Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials