The Analysis and Investigation of Multiplicative Inverse Searching Methods in the Ring of Integers Modulo M
暂无分享,去创建一个
Zhengbing Hu | I. A. Dychka | Onai Mykola | Bartkoviak Andrii | Zhengbing Hu | I. Dychka | Onai Mykola | Bartkoviak Andrii
[1] Róbert Lórencz,et al. New Algorithm for Classical Modular Inverse , 2002, CHES.
[2] Jean-Jacques Quisquater,et al. Efficient Modular Division Implementation: ECC over GF(p) Affine Coordinates Application , 2004, FPL.
[3] Jean-Pierre Seifert,et al. Note on Fast Computation of Secret RSA Exponents , 2002, ACISP.
[4] Jonathan P. Sorenson. Two Fast GCD Algorithms , 1994, J. Algorithms.
[5] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[6] Marc Joye,et al. GCD-Free Algorithms for Computing Modular Inverses , 2003, CHES.
[7] C. Pomerance,et al. Prime Numbers: A Computational Perspective , 2002 .
[8] R. Blahut. Theory and practice of error control codes , 1983 .