Trace expression of r-th root over finite field
From MaRDI portal
Publication:5118842
DOI10.4134/JKMS.J190569zbMATH Open1478.11143MaRDI QIDQ5118842FDOQ5118842
Authors: Gook Hwa Cho, Namhun Koo, Soonhak Kwon
Publication date: 27 August 2020
Recommendations
finite fieldtracelinear recurrence relationTonelli-Shanks algorithmCipolla-Lehmer algorithmAdleman-Manders-Miller algorithm\(r\)-th root
Analysis of algorithms (68W40) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Public-key cryptosystems based on cubic finite field extensions
- Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computation of square roots in finite fields
- Title not available (Why is that?)
- Improved generalized Atkin algorithm for computing square roots in finite fields
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- Adleman-Manders-Miller root extraction method revisited
- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences
Cited In (6)
- New cube root algorithm based on the third order linear recurrence relations in finite fields
- On the Cipolla-Lehmer type algorithms in finite fields
- Efficient computation of roots in finite fields
- On the computation of \(r\)-th roots in finite fields
- Adleman-Manders-Miller root extraction method revisited
- Order dividing extension fields and the root computation problem
This page was built for publication: Trace expression of \(r\)-th root over finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118842)