A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Modular Reduction Operation Based on Monic Pentanomial
With the development of public key cryptography, especially elliptic curve cryptography, the research on the modular reduction with special moduli, such as Mersenne number, pseudo-Mersenne number, and generalized Mersenne number, have been rekindled. In this paper, we analysis and study modulo reduction operation based on monic polynomial, and obtain the following results: for Mersenne number and pseudo-Mersenne numbers, we obtain modular reduction formulas, and determine exact expressions of the number of modular addition to monic pentanomial. Using these formulas, one can easily compute the number of modular addition of A mod p for any given monic pentanomial.
Modular Reduction Operation Based on Monic Pentanomial
With the development of public key cryptography, especially elliptic curve cryptography, the research on the modular reduction with special moduli, such as Mersenne number, pseudo-Mersenne number, and generalized Mersenne number, have been rekindled. In this paper, we analysis and study modulo reduction operation based on monic polynomial, and obtain the following results: for Mersenne number and pseudo-Mersenne numbers, we obtain modular reduction formulas, and determine exact expressions of the number of modular addition to monic pentanomial. Using these formulas, one can easily compute the number of modular addition of A mod p for any given monic pentanomial.
Modular Reduction Operation Based on Monic Pentanomial
Qingxian, Wang (author) / Mingsheng, Shang (author) / Yan, Fu (author)
2006-06-01
3651248 byte
Conference paper
Electronic Resource
English
The peculiar (monic) polynomials, the zeros of which equal their coefficients
| British Library Online Contents | 2017