Discrete Applied Mathematics
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
CM-Curves with Good Cryptographic Properties
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Elliptic Scalar Multiplication Using Point Halving
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
On the Number of Trace-One Elements in Polynomial Bases for $$\mathbb{F}_{2^n}$$
Designs, Codes and Cryptography
Formulas for cube roots in F3m
Discrete Applied Mathematics
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Delaying and merging operations in scalar multiplication: applications to curve-based cryptosystems
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On redundant T-adic expansions and non-adjacent digit sets
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Efficient divisor class halving on genus two curves
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Efficient doubling on genus two curves over binary fields
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Field inversion and point halving revisited
IEEE Transactions on Computers
Finite Fields and Their Applications
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition
Efficient software implementation of binary field arithmetic using vector instruction sets
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
| Hi-index | 0.00 |
We discuss a family of irreducible polynomials that can be used to speed up square root extraction in fields of characteristic two. They generalize trinomials discussed by Fong et al. [20]. We call such polynomials square root friendly. The main application is to point halving methods for elliptic curves (and to a lesser extent also divisor halving methods for hyperelliptic curves and pairing computations). 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. Following similar results by Bluher, we also give a partial result that goes in the direction of the conjecture. We also discuss how to improve the speed of solving quadratic equations. The increase in the time required to perform modular reduction is marginal and does not affect performance adversely. Estimates confirm that the new polynomials mantain their promises. Point halving gets a speed-up of 20% and scalar multiplication is improved by at least 11%.