Low-latency semi-systolic architecture for multiplication over finite fields

Abstract

In this letter, we propose a low-latency semi-systolic architecture for multiplication based on the shifted polynomial basis over finite fields. The proposed multiplier saves at least 49.9% time complexity and 23.7% area-time complexity as compared to the related multipliers. The proposed multiplier can be used as a core circuit for various applications.