Optimal Extension Field Inversion in the Frequency Domain
From MaRDI portal
Publication:3519551
DOI10.1007/978-3-540-69499-1_5zbMath1202.11053OpenAlexW1551781172MaRDI QIDQ3519551
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_5
finite fieldsdiscrete Fourier transforminversionelliptic curve cryptographynumber theoretic transform
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Optimal Extension Field Inversion in the Frequency Domain
- A method for obtaining digital signatures and public-key cryptosystems
- An Algorithm for the Machine Calculation of Complex Fourier Series
- The Fast Fourier Transform in a Finite Field
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
This page was built for publication: Optimal Extension Field Inversion in the Frequency Domain