IEICE TRANSACTIONS on Fundamentals
Fast Montgomery-Like Square Root Computation for All Trinomials
Summary :
We introduce a new type of Montgomery-like square root formulae in GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By choosing proper Montgomery factors for different kind of trinomials, the space and time complexities of such square root computations match or outperform the best results. A practical application of the Montgomery-like square root in inversion computation is also presented.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.1 pp.307-309
- Publication Date
- 2019/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.307
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Yin LI
Xinyang Normal University
Yu ZHANG
Xinyang Normal University
Xiaoli GUO
Xinyang Normal University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yin LI, Yu ZHANG, Xiaoli GUO, "Fast Montgomery-Like Square Root Computation for All Trinomials" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 1, pp. 307-309, January 2019, doi: 10.1587/transfun.E102.A.307.
Abstract: We introduce a new type of Montgomery-like square root formulae in GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By choosing proper Montgomery factors for different kind of trinomials, the space and time complexities of such square root computations match or outperform the best results. A practical application of the Montgomery-like square root in inversion computation is also presented.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.307/_p
Copy
@ARTICLE{e102-a_1_307,
author={Yin LI, Yu ZHANG, Xiaoli GUO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Fast Montgomery-Like Square Root Computation for All Trinomials},
year={2019},
volume={E102-A},
number={1},
pages={307-309},
abstract={We introduce a new type of Montgomery-like square root formulae in GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By choosing proper Montgomery factors for different kind of trinomials, the space and time complexities of such square root computations match or outperform the best results. A practical application of the Montgomery-like square root in inversion computation is also presented.},
keywords={},
doi={10.1587/transfun.E102.A.307},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Fast Montgomery-Like Square Root Computation for All Trinomials
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 307
EP - 309
AU - Yin LI
AU - Yu ZHANG
AU - Xiaoli GUO
PY - 2019
DO - 10.1587/transfun.E102.A.307
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2019
AB - We introduce a new type of Montgomery-like square root formulae in GF(2m) defined by an arbitrary irreducible trinomial, which is more efficient compared with classic square root operation. By choosing proper Montgomery factors for different kind of trinomials, the space and time complexities of such square root computations match or outperform the best results. A practical application of the Montgomery-like square root in inversion computation is also presented.
ER -
English
