Square Root Computation over Even Extension Fields

DOI10.1109/TC.2013.145zbMATH Open1364.94518OpenAlexW2111465179MaRDI QIDQ5267367FDOQ5267367

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

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

Cited In (5)

• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• On the computation of square roots in finite fields
• On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
• Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
• Multiple point compression on elliptic curves

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)