
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Anwar Hasan, Christophe Negre, "Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation," IEEE Transactions on Computers, vol. 60, no. 4, pp. 602607, April, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.132, author = {M. Anwar Hasan and Christophe Negre}, title = {Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {4}, issn = {00189340}, year = {2011}, pages = {602607}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.132}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation IS  4 SN  00189340 SP602 EP607 EPD  602607 A1  M. Anwar Hasan, A1  Christophe Negre, PY  2011 KW  Binary field KW  Dickson basis KW  Toeplitz matrix KW  multiplier KW  parallel KW  sequential. VL  60 JA  IEEE Transactions on Computers ER   
[1] B. Ansari and M. Anwar Hasan, "Revisiting Finite Field Multiplication Using Dickson Bases," technical report, Univ. of Waterloo, 2007.
[2] L.E. Dickson, "The Analytic Representation of Substitutions on a Power of a Prime Number of Letters with a Discussion of the Linear Group," Annals of Math., vol. 11, pp. 161183, 1897.
[3] H. Fan and M.A. Hasan, "A New Approach to SubQuadratic Space Complexity Parallel Multipliers for Extended Binary Fields," IEEE Trans. Computers, vol. 56, no. 2, pp. 224233, Feb. 2007.
[4] H. Fan and M.A. Hasan, "Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases," IEEE Trans. Computers, vol. 56, no. 10, pp. 14351437, Oct. 2007.
[5] J. Zur Gathen, A. Shokrollahi, and J. Shokrollahi, "Efficient Multiplication Using Type 2 Optimal Normal Bases," Proc. First Int'l Workshop Arithmetic of Finite Fields (WAIFI '07), pp. 5568, 2007.
[6] M.A. Hasan and C. Negre, "Subquadratic Space Complexity Multiplication Over Binary Fields with Dickson Polynomial Representation," Proc. Second Int'l Workshop Arithmetic of Finite Fields (WAIFI '08), pp. 88102, 2008.
[7] R. Lild, G.L. Mullen, and G. Turnwald, Dickson Polynomials, vol. 65, Pitman Monograph and Survey in Pure and Applied Math., 1993.
[8] R.C. Mullin and A. Mahalanobis, "Dickson Bases and Finite Fields," technical report, Univ. of Waterloo, 2007.
[9] C. Paar, "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields," IEEE Trans. Computers, vol. 45, no. 7, pp. 856861, July 1996.
[10] A. ReyhaniMasoleh and M.A. Hasan, "Low Complexity Sequential Normal Basis Multipliers over GF($2^m$ )," Proc. 16th IEEE Symp. Computer Arithmetic (ARITH '03), pp. 188195, 2003.
[11] B. Sunar, "A Generalized Method for Constructing Subquadratic Complexity GF($2^k$ ) Multipliers," IEEE Trans. Computers, vol. 53, no. 9, pp. 10971105, Sept. 2004.
[12] D.J. Yang, C.H. Kim, Y.H. Park, Y. Kim, and J. Lim, "Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases," Proc. Int'l Conf. Computational Science and Its Applications (ICCSA), pp. 647656, 2005.