
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Amir K. Daneshbeh, M. Anwar Hasan, "A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over {\rm GF}(2^m)," IEEE Transactions on Computers, vol. 54, no. 3, pp. 370380, March, 2005.  
BibTex  x  
@article{ 10.1109/TC.2005.35, author = {Amir K. Daneshbeh and M. Anwar Hasan}, title = {A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over {\rm GF}(2^m)}, journal ={IEEE Transactions on Computers}, volume = {54}, number = {3}, issn = {00189340}, year = {2005}, pages = {370380}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2005.35}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over {\rm GF}(2^m) IS  3 SN  00189340 SP370 EP380 EPD  370380 A1  Amir K. Daneshbeh, A1  M. Anwar Hasan, PY  2005 KW  Division KW  extended Euclidean algorithm KW  finite fields KW  field arithmetic KW  inversion KW  systolic arrays. VL  54 JA  IEEE Transactions on Computers ER   
[1] E. Berlekamp, Algebraic Coding Theory. McGrawHill, 1968.
[2] A. Menezes, P. van Ooreschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.
[3] T. Itoh and S. Tsujii, “A Fast Algorithm for Computing Multiplicative Inverses in ${\rm GF}(2^m)$ Using Normal Basis,” Information and Computation, vol. 78, pp. 171177, 1988.
[4] C.T. Huang and C.W. Wu, “HighSpeed CTestable Systolic Array Design for GaloisField Inversion,” Proc. European Design and Test Conf., pp. 342346, Mar. 1997.
[5] R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, “Fast Key Exchange with Elliptic Curve Systems,” Advances in Cryptology, Proc. EUROCRYPT '95, pp. 4356, 1995.
[6] Y. Watanabe, N. Takagi, and K. Takagi, “A VLSI Algorithm for Division in ${\rm GF}(2^m)$ Based on Extended Binary GCD Algorithm,” Trans. Inst. of Electronics, Information and Comm. Engineers, IEICE '02, vol. E85, no. 5, pp. 994999, 2002.
[7] M. Hasan, “DoubleBasis Multiplicative Inversion over ${\rm GF}(2^m)$ ,” IEEE Trans. Computers, vol. 47, no. 9, pp. 960970, Sept. 1998.
[8] J.H. Guo and C.L. Wang, “BitSerial Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in $GF(2^m)$ ,” Proc. Technical Papers, Int'l Symp. VLSI Technology, Systems, and Applications, pp. 113117, June 1997.
[9] J.H. Guo and C.L. Wang, “Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in ${\rm GF}(2^m)$ ,” IEE Proc. Computers and Digital Techniques, vol. 145, no. 4, pp. 272278, July 1998.
[10] C.H. Wu, C.M. Wu, M.D. Shieh, and Y.T. Hwang, “Systolic VLSI Realization of a Novel Iterative Division Algorithm over ${\rm GF}(2^m)$ : A High Speed LowComplexity Design,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '01), vol. 4, pp. 3336, 2001.
[11] C.H. Wu, C.M. Wu, M.D. Shieh, and Y.T. Hwang, “An AreaEfficient Systolic Division Circuit over ${\rm GF}(2^m)$ for Secure Communication,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '02), vol. 5, pp. 733736, 2002.
[12] Z. Yan and D. Sarwate, “Systolic Architectures for Finite Field Inversion and Division,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '02), vol. 5, pp. 789792, 2002.
[13] H. Brunner, A. Curiger, and M. Hofstetter, “On Computing Multiplicative Inverses in ${\rm GF}(2^m)$ ,” IEEE Trans. Computers, vol. 42, no. 8, pp. 10101015, Aug. 1993.
[14] A.F. Tenca, G. Todorov, and C. Koc, “HighRadix Design of a Scalable Modular Multiplier,” Proc. Third Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES 2001), pp. 185201, May 2001.
[15] A. Daneshbeh and M. Hasan, “A Class of Scalable Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over ${\rm GF}(2^m)$ ,” Technical Report CORR 200235, http:/www.cacr.math.uwaterloo.ca, Dec. 2002.
[16] A. Daneshbeh and M. Hasan, “A Unidirectional Bit Serial Systolic Architectures for DoubleBasis Division over ${\rm GF}(2^m)$ ,” Proc. 16th. IEEE Symp. Computer Arithmetic (Arith16), pp. 174187, June 2003.
[17] J.H. Guo and C.L. Wang, “Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in ${\rm GF}(2^m)$ ,” IEEE Trans. Computers, vol. 47, no. 10, pp. 11611167, Oct. 1998.
[18] J.H. Guo and C.L. Wang, “Novel DigitSerial Systolic Array Implementation of Euclid's Algorithm for Division in $GF(2^m)$ ,” Proc. IEEE Int'l Symp. Circuits and Systems (ISCAS '98), vol. 2, pp. 478481, 1998.
[19] J. McCanny, R. Evans, and J. McWhirter, “Use of Unidirectional Data Flow in BitLevel Systolic Array Chips,” Electronics Letters, vol. 22, pp. 540541, May 1986.