Abstract
In this paper, we present efficient parallel and serial systolic structures for combined multiplication and squaring over GF( 2m ). The proposed structures have the advantage of computing both modular multiplication and squaring simultaneously for fast execution of modular exponentiation. They share the same hardware components for both operations and this gives them the advantage of saving more space than the case of using a separate structure for each operation. In addition, they have a regular structure and local communication between the processing elements and this makes them more efficient for VLSI implementation. Complexity analysis of the proposed designs and the existing most recent and efficient designs indicates that the proposed serial design has 31.7% lower area-time (AT) complexity than the previously reported most recent serial one. In addition, the proposed parallel design has a significant lower AT complexity over the recent efficient parallel designs by at least 96.9%.
| Original language | English |
|---|---|
| Article number | 8744654 |
| Pages (from-to) | 114-120 |
| Number of pages | 7 |
| Journal | Canadian Journal of Electrical and Computer Engineering |
| Volume | 42 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Mar 2019 |
Keywords
- Finite field multiplication
- finite field squaring
- hardware security
- parallel processing
- systolic arrays