Efficient \(p\)th root computations in finite fields of characteristic \(p\)
From MaRDI portal
Publication:1009125
DOI10.1007/s10623-008-9236-0zbMath1196.12002OpenAlexW2060682338MaRDI QIDQ1009125
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-008-9236-0
Related Items
Swan-like results for binomials and trinomials over finite fields of odd characteristic ⋮ Fast multivariate multi-point evaluation revisited ⋮ A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity
Cites Work
- Unnamed Item
- Formulas for cube roots in \(\mathbb F_{3^m}\)
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five
- Factorization of polynomials over finite fields
- Efficient implementation of pairing-based cryptosystems
- Advances in Cryptology - ASIACRYPT 2003
- Factoring polynomials over finite fields: A survey
This page was built for publication: Efficient \(p\)th root computations in finite fields of characteristic \(p\)