Loading...
Search for:
binary-extension-finite-field
0.005 seconds
High-throughput low-complexity unified multipliers over GF(2m) in dual and triangular bases
, Article IEEE Transactions on Circuits and Systems I: Regular Papers ; Volume PP, Issue 99 , 2016 ; 15498328 (ISSN) ; Bayat Sarmadi, S ; Farmani, M ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
Abstract
Multiplication is an essential operation in cryptographic computations. One of the important finite fields for such computations is the binary extension field. High-throughput low-complexity multiplication architectures lead to more efficient cryptosystems. In this paper, a high-throughput low-complexity unified multiplier for triangular and dual bases is presented, and is referred to as basic architecture. This multiplier enjoys slightly simpler and more regular structure due to use of the mentioned bases. Additionally, structurally improved architectures have been proposed, which have smaller time complexity than basic ones. This is achieved by the use of parallel processing method....