A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
From MaRDI portal
Publication:1120276
DOI10.1016/0890-5401(88)90024-7zbMath0672.68015OpenAlexW2007751412MaRDI QIDQ1120276
Publication date: 1988
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(88)90024-7
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Approximation algorithms (68W25)
Related Items (48)
Effective compression maps for torus-based cryptography ⋮ An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation ⋮ Logic minimization techniques with applications to cryptology ⋮ Improved generalized Atkin algorithm for computing square roots in finite fields ⋮ Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$ ⋮ Efficient software-implementation of finite fields with applications to cryptography ⋮ A Euclidean algorithm for normal bases ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials ⋮ On design of circuits of logarithmic depth for inversion in finite fields ⋮ Computing special powers in finite fields ⋮ On the structure of digital explicit nonlinear and inversive pseudorandom number generators ⋮ Structure of parallel multipliers for a class of fields \(GF(2^ m)\) ⋮ Complexity of computation in finite fields ⋮ Fast Implementation of Curve25519 Using AVX2 ⋮ Concrete quantum cryptanalysis of binary elliptic curves via addition chain ⋮ Fast Point Decompression for Standard Elliptic Curves ⋮ Unnamed Item ⋮ Efficiently masking polynomial inversion at arbitrary order ⋮ Quantum circuit implementations of AES with fewer qubits ⋮ A simple stream cipher with proven properties ⋮ Optimal Extension Field Inversion in the Frequency Domain ⋮ Efficient Finite Fields in the Maxima Computer Algebra System ⋮ On Fast Calculation of Addition Chains for Isogeny-Based Cryptography ⋮ Quantum-assisted QD-CFS signatures ⋮ Computational problems in the theory of finite fields ⋮ Efficient Multiplication in Finite Field Extensions of Degree 5 ⋮ Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors ⋮ Efficient computation of roots in finite fields ⋮ A comparison of different finite fields for elliptic curve cryptosystems ⋮ Integer Variable χ–Based Ate Pairing ⋮ A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Elliptic periods for finite fields ⋮ High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions ⋮ Fast polynomial inversion for post quantum QC-MDPC cryptography ⋮ Characterization for a family of infinitely many irreducible equally spaced polynomials ⋮ Koblitz curves over quadratic fields ⋮ Parallelizing the Weil and Tate Pairings ⋮ High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\) ⋮ High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms ⋮ Taking roots over high extensions of finite fields ⋮ Some efficient quantum circuit implementations of Camellia ⋮ Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration ⋮ Implementing Grover oracles for quantum key search on AES and LowMC
Cites Work
This page was built for publication: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
