Efficient computation of roots in finite fields
From MaRDI portal
Publication:2491305
DOI10.1007/s10623-005-4017-5zbMath1172.12008OpenAlexW2021739205MaRDI QIDQ2491305
Paulo S. L. M. Barreto, José Felipe Voloch
Publication date: 29 May 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-005-4017-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
On the Cipolla-Lehmer type algorithms in finite fields ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x\)] ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ An optimal representation for the trace zero subgroup ⋮ Multivariate public key cryptosystem from Sidon spaces ⋮ Taking roots over high extensions of finite fields ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields
Cites Work
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Algorithms for exponentiation in finite fields
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
- Arithmetic on superelliptic curves
- Identity-based authenticated key agreement protocol based on Weil pairing
- Identity-Based Encryption from the Weil Pairing
- On addition chains
This page was built for publication: Efficient computation of roots in finite fields
