
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rui Deng, Yujie Zhou, "Improvement to Montgomery Modular Inverse Algorithm," IEEE Transactions on Computers, vol. 55, no. 9, pp. 12071210, September, 2006.  
BibTex  x  
@article{ 10.1109/TC.2006.150, author = {Rui Deng and Yujie Zhou}, title = {Improvement to Montgomery Modular Inverse Algorithm}, journal ={IEEE Transactions on Computers}, volume = {55}, number = {9}, issn = {00189340}, year = {2006}, pages = {12071210}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.150}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improvement to Montgomery Modular Inverse Algorithm IS  9 SN  00189340 SP1207 EP1210 EPD  12071210 A1  Rui Deng, A1  Yujie Zhou, PY  2006 KW  Montgomery modular inverse KW  modular arithmetic KW  cryptography. VL  55 JA  IEEE Transactions on Computers ER   
[1] B.S. Kaliski Jr., “The Montgomery Inverse and Its Applications,” IEEE Trans. Computers, vol. 44, no. 8, pp. 10641065, Aug. 1995.
[2] E. Savas and Ç.K. Koç, “The Montgomery Modular InverseRevisited,” IEEE Trans. Computers, vol. 49, no. 7, pp. 763766, July 2000.
[3] A. Gutub, “A Scalable Hardware for Montgomery Modular Inverse Computation,” technical report, Information Security Laboratory, Electrical and Computer Eng. Dept., Oregon State Univ., Corvallis, June 2001.
[4] A. Gutub, A.F. Tenca, and Ç.K. Koç, “Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation,” Proc. IEEE CS Ann. Symp. VLSI, pp. 5358, 2002.
[5] R. Lórencz, “New Algorithm for Classical Modular Inverse,” Proc. Fourth Int'l Workshop Cryptographic Hardware and Embedded Systems, revised papers, pp. 5770, 2002.
[6] A.A.A. Gutub and A.F. Tenca, “Efficient Scalable Hardware Architecture for Montgomery Inverse Computation in GF(p),” Proc. IEEE Workshop Signal Proceesing Systems (SIPS '03), pp. 9398, Aug. 2003.
[7] C. McIvor, M. McLoone, and J.V. McCanny, “Improved Montgomery Modular Inverse Algorithm,” IEEE Electronics Letters, vol. 40, no. 18, pp.11101112, Sept. 2004.
[8] A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.
[9] D.E. Knuth, The Art of Computer Programming, volume 2, Seminumerical Algorithm, third ed. Reading, Mass.: AddisonWesley, 1998.
[10] A.A.A. Gutub, A.F. Tenca, E. Savas, and Ç.K. Koç, “Scalable and Unified Hardware to Compute Montgomery Inverse in $GF(p)$ and $GF(2^n)$ ,” Proc. Workshop Cryptography Hardware and Embedded Systems (CHES 2002), pp.484499, Aug. 2002.