Name
Abstract | ||
|---|---|---|
This letter is concerned with an extension of Takagi et al. algorithm (TYT) for inversion computation in GF(2^m). Unlike the original algorithm, the method introduced here uses a polynomial basis representation. As the main contribution, the proposed method reduces both the number of required multiplications and squaring operations by applying a modified decomposition for m-1. When the field is generated with an irreducible trinomial, our proposal shows almost the same practical complexity as the TYT algorithm using normal basis. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.ipl.2010.02.006 | Inf. Process. Lett. |
Keywords | Field | DocType |
main contribution,polynomial basis representation,tyt algorithm,modified decomposition,irreducible trinomial,inversion computation,tyt inversion algorithm,practical complexity,normal basis,original algorithm,multiplicative inverse,algorithms | Polynomial basis,Discrete mathematics,Multiplicative inverse,Polynomial,Algorithm,Decomposition method (constraint satisfaction),Normal basis,Multiplication,Mathematics,Trinomial,Computation | Journal |
Volume | Issue | ISSN |
110 | 8-9 | 0020-0190 |
Citations | PageRank | References |
1 | 0.40 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yin Li | 1 | 11 | 2.95 |
| Gong-Liang Chen | 2 | 160 | 13.54 |
| Yi-yang Chen | 3 | 3 | 1.10 |
| Jian-hua Li | 4 | 558 | 98.16 |