Formulas for cube roots in \(\mathbb F_{3^m}\)
From MaRDI portal
Publication:868380
DOI10.1016/j.dam.2006.06.004zbMath1111.11060OpenAlexW1981209126MaRDI QIDQ868380
Darrel Hankerson, Omran Ahmadi, Alfred J. Menezes
Publication date: 2 March 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.06.004
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Related Items (7)
A class of Gaussian normal bases and their dual bases ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Unnamed Item ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis ⋮ Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic ⋮ Efficient \(p\)th root computations in finite fields of characteristic \(p\) ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields
Cites Work
- Polynomial and normal bases for finite fields
- Hardware Acceleration of the Tate Pairing in Characteristic Three
- Efficient Hardware for the Tate Pairing Calculation in Characteristic Three
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Advances in Cryptology - ASIACRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Formulas for cube roots in \(\mathbb F_{3^m}\)
