An extension of TYT inversion algorithm in polynomial basis
From MaRDI portal
Recommendations
- An extension of TYT algorithm for GF((2ⁿ)^m) using precomputation
- An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- scientific article; zbMATH DE number 39192
- scientific article; zbMATH DE number 24470
Cites work
- scientific article; zbMATH DE number 1135075 (Why is no real title available?)
- scientific article; zbMATH DE number 1759279 (Why is no real title available?)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
- A modified Massey-Omura parallel multiplier for a class of finite fields
- A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
- An efficient optimal normal basis type II multiplier
- An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Mastrovito multiplier for all trinomials
- On Orders of Optimal Normal Basis Generators
- Optimal normal bases in \(GF(p^ n)\)
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
Cited in
(4)- A simple stream cipher with proven properties
- An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
This page was built for publication: An extension of TYT inversion algorithm in polynomial basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991790)
