Welcome to the resource topic for 2017/064
Title:
Fast Montgomery-like Square Root Computation over GF(2^m) for All Trinomials
Authors: Yin Li, Yu Zhang
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.
ePrint: https://eprint.iacr.org/2017/064
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .