Optimal Extension Field Inversion in the Frequency Domain
From MaRDI portal
Recommendations
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
- Optimal tower fields
- An improvement of the TYT algorithm for \(\mathrm{GF}(2^m)\) based on reusing intermediate computation results
- scientific article; zbMATH DE number 1088245
Cites work
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- A method for obtaining digital signatures and public-key cryptosystems
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4054986 (Why is no real title available?)
- scientific article; zbMATH DE number 1302866 (Why is no real title available?)
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Optimal Extension Field Inversion in the Frequency Domain
- The Fast Fourier Transform in a Finite Field
Cited in
(4)
This page was built for publication: Optimal Extension Field Inversion in the Frequency Domain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519551)