Name
Abstract | ||
|---|---|---|
Finite field multipliers are embedded in many applications. In some applications, e.g., in cryptographic primitives protected by security oriented codes, only r bits out of the m-bit product are required. In such cases, the circuit area can be significantly reduced by implementing a punctured finite field multiplier. This article deals with efficient implementation of multipliers. It is shown that... |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TCSI.2015.2451914 | IEEE Transactions on Circuits and Systems I: Regular Papers |
Keywords | Field | DocType |
Logic gates,Polynomials,Upper bound,Security,Finite element analysis,Complexity theory,Galois fields | Discrete mathematics,Finite field,Upper and lower bounds,Factorization of polynomials over finite fields,Finite field arithmetic,Irreducible polynomial,Galois theory,Binary operation,Mathematics,Trinomial | Journal |
Volume | Issue | ISSN |
62 | 9 | 1549-8328 |
Citations | PageRank | References |
1 | 0.35 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaara Neumeier | 1 | 16 | 2.77 |
| Y. Pesso | 2 | 1 | 0.35 |
| Osnat Keren | 3 | 106 | 20.19 |