Paper 2017/064 Original: eprint.iacr.org/2017/064 ↗
Fast Montgomery-like Square Root Computation over $GF(2^m)$ for All Trinomials
Abstract
This letter is concerned with an extension of square root computation over $GF(2^m)$ defined by irreducible trinomials. We introduce a new type of Montgomery-like square root formulae, which is more efficient compared with classic square root operation. By choosing proper Montgomery factor regarding to different types of trinomials, the space and time complexities of our proposal outperform or match the best results. Furthermore, a practical application of the Montgomery-like square root in exponentiation computation is also presented.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2017-08-09: last updated
- 2017-01-31: published
- Short URL
- https://ia.cr/2017/064
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/064,
author = {Yin Li and Yu Zhang},
title = {Fast Montgomery-like Square Root Computation over $GF(2^m)$ for All Trinomials},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/064},
year = {2017},
url = {https://eprint.iacr.org/2017/064}
}