Order dividing extension fields and the root computation problem

MaRDI QIDQ3635546zbMATH OpenFDO

Authors Anna M. Johnston

Publication date 6 July 2009

zbMATH Keywords

Cipolla's algorithmfinite fields, trace, cryptographyRoot computation problem

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Recommendations

• Trace expression of \(r\)-th root over finite field
• Efficient computation of roots in finite fields
• Taking roots over high extensions of finite fields
• A geometric approach to root finding in GT(q/sup m/)
• New cube root algorithm based on the third order linear recurrence relations in finite fields

Cited in

(2)

• Forking and dividing in fields with several orderings and valuations
• Trace expression of \(r\)-th root over finite field

This page was built for publication: Order dividing extension fields and the root computation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635546)