Square Root Computation over Even Extension Fields

DOI10.1109/TC.2013.145MaRDI QIDQ5267367zbMATH OpenOpenAlexFDO

Authors Gora Adj, Francisco Rodríguez-Henríquez

Publication date 20 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2013.145

Mathematics Subject Classification ID

Power residues, reciprocity (11A15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Cited in

(8)

• On the computation of square roots in finite fields
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• On fast calculation of addition chains for isogeny-based cryptography
• Multiple point compression on elliptic curves
• Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
• Efficient theta-based algorithms for computing ( , )-isogenies on Kummer surfaces for arbitrary odd
• A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
• Attacks on PRISM-id via torsion over small extension fields

This page was built for publication: Square Root Computation over Even Extension Fields

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