Name
Abstract | ||
|---|---|---|
We present a bit-parallel polynomial basis multiplier based on a new divide-and-conquer approach using squaring. In particular, we apply the proposed approach to special types of irreducible pentanomials called as types I and II pentanomials, and induce explicit formulae and complexities of the proposed multiplier for these types of pentanomials. As a result, the proposed multiplier for type I pentanomials has almost the same time complexity, but about 25% reduced space complexity compared with the best known results in the literature. For type II pentanomials, we obtain the multiplier which has the lowest time complexity and about 25% reduced space complexity than the best known polynomial basis multipliers. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.vlsi.2013.03.001 | Integration |
Keywords | Field | DocType |
type ii pentanomials,proposed multiplier,new efficient bit-parallel polynomial,special pentanomials,polynomial basis multiplier,ii pentanomials,bit-parallel polynomial basis multiplier,lowest time complexity,reduced space complexity,time complexity,irreducible pentanomials,finite field arithmetic | Polynomial basis,Explicit formulae,Algebra,Multiplier (economics),Finite field arithmetic,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
47 | 1 | 0167-9260 |
Citations | PageRank | References |
2 | 0.37 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sun-Mi Park | 1 | 18 | 1.97 |
| Ku-Young Chang | 2 | 55 | 14.89 |
| Dowon Hong | 3 | 259 | 47.25 |
| Changho Seo | 4 | 90 | 19.36 |