Fast Asymptotic Square Root for Two Types of Special Pentanomials
Inspired by the Montgomery and generalized polynomial basis (GPB) squaring operation, we introduce and study the notion of asymptotic square root over binary extension fields GF(2<sup>m</sup>). This new notion is a natural generalization of Montgomery-like square root, a special form of...
Main Authors: | Yu Zhang, Yin Li, Qing Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8691429/ |
Similar Items
-
Efficient Square-Based Montgomery Multiplier for All Type C.1 Pentanomials
by: Yin Li, et al.
Published: (2018-01-01) -
Robustness of mean-square exponential dichotomies for linear stochastic equations
by: Hailong Zhu, et al.
Published: (2017-05-01) -
A Low-Cost High Radix Floating-Point Square-Root Circuit
by: Yuheng Yang, et al.
Published: (2021-08-01) -
Square Root Convexity of Fisher Information along Heat Flow in Dimension Two
by: Junliang Liu, et al.
Published: (2023-03-01) -
A Note on the Asymptotic Normality Theory of the Least Squares Estimates in Multivariate HAR-RV Models
by: Won-Tak Hong, et al.
Published: (2020-11-01)