Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block RecombinationKABRshown thattheoretical analysisRecently, high-performance elliptic curve cryptography has gained great attention for resource-constrained applications. In this paper, we use (a, b)-way Karatsuba...
Koç and Sunar proposed an architecture of the Mastrovito multiplier for the irreducible trinomial f(x)=xn+xk+1, where k ≠ n/2 to reduce the time complexity. Also, many multipliers based on the Karatsuba-Ofman algorithm (KOA) was proposed that sacrificed time efficiency for low space com...
Ko莽 and Sunar proposed an architecture of the Mastrovito multiplier for the irreducible trinomial $f(x)=x^{n}+x^{k}+1$ , where $kneq n/2$ to reduce the time complexity. Also, many multipliers based on the Karatsuba-Ofman algorithm (KOA) was proposed that sacrificed time efficiency ...
Section 3 explains the developed DG of the adopted algorithm. Section 4 describes the methodology used to extract the recommended bit-parallel systolic multiplier structure. Section 5 presents the complexity analysis of the proposed multiplier and of the existing efficient structures. Furthermore, it ...