Square Root Computation over Even Extension Fields

DOI10.1109/TC.2013.145zbMath1364.94518OpenAlexW2111465179MaRDI QIDQ5267367

Francisco Rodríguez-Henríquez, Gora Adj

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

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

Related Items

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