Paper 2007/103
Another Look at Square Roots and Traces (and Quadratic Equations) in Fields of Even Characteristic
Roberto Avanzi
Abstract
We discuss irreducible polynomials that can be
used to speed up square root extraction in fields of characteristic two.
We call such polynomials \textit{square root friendly}.
The obvious applications are to point halving methods for elliptic curves
and divisor halving methods for hyperelliptic curves.
We note the existence of square root friendly trinomials of a given
degree when we already know that an irreducible trinomial of the same
degree exists, and formulate a conjecture on the degrees of the terms of
square root friendly polynomials.
We also give a partial result
that goes in the direction of the conjecture.
Irreducible polynomials
Note: Extended version with new results of previous note.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Binary fieldsPolynomial basisSquare root extractionTrace computationQuadratic equationsPoint halvingDivisor halving.
- Contact author(s)
- roberto avanzi @ gmail com
- History
- 2007-05-30: last of 10 revisions
- 2007-03-22: received
- See all versions
- Short URL
- https://ia.cr/2007/103
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/103, author = {Roberto Avanzi}, title = {Another Look at Square Roots and Traces (and Quadratic Equations) in Fields of Even Characteristic}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/103}, year = {2007}, url = {https://eprint.iacr.org/2007/103} }