Efficient \(p\)th root computations in finite fields of characteristic \(p\)
From MaRDI portal
Publication:1009125
DOI10.1007/s10623-008-9236-0zbMath1196.12002MaRDI 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
12E20: Finite fields (field-theoretic aspects)
Related Items
Swan-like results for binomials and trinomials over finite fields of odd characteristic, A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields, Fast multivariate multi-point evaluation revisited, 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
- 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
- Unnamed Item