
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Anwar Hasan, Nicolas Méloni, Ashkan Hosseinzadeh Namin, Christophe Negre, "Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz MatrixVector Product," IEEE Transactions on Computers, vol. 61, no. 2, pp. 151163, February, 2012.  
BibTex  x  
@article{ 10.1109/TC.2010.276, author = {M. Anwar Hasan and Nicolas Méloni and Ashkan Hosseinzadeh Namin and Christophe Negre}, title = {Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz MatrixVector Product}, journal ={IEEE Transactions on Computers}, volume = {61}, number = {2}, issn = {00189340}, year = {2012}, pages = {151163}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.276}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz MatrixVector Product IS  2 SN  00189340 SP151 EP163 EPD  151163 A1  M. Anwar Hasan, A1  Nicolas Méloni, A1  Ashkan Hosseinzadeh Namin, A1  Christophe Negre, PY  2012 KW  Binary field KW  subquadratic space complexity multiplier KW  Toeplitz matrix KW  block recombination. VL  61 JA  IEEE Transactions on Computers ER   
[1] J.C. Bajard, L. Imbert, and G.A. Jullien, "Parallel Montgomery Multiplication in GF($2^{{\rm k}}$ ) Using Trinomial Residue Arithmetic," Proc. IEEE Symp. Computer Arithmetic, pp. 164171, 2005.
[2] D.J. Bernstein, "Batch Binary Edwards," CRYPTO '09: Proc. Conf. Advances in Cryptology, pp. 317336, 2009.
[3] A.E. Cohen and K.K. Parhi, "Implementation of Scalable Elliptic Curve Cryptosystem CryptoAccelerators for GF($2^m$ )," Proc. 13th Asilomar Conf. Signals, Systems, and Computers, pp. 471477, 2004.
[4] 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, Sept. 2007.
[5] H. Fan, J. Sun, M. Gu, and K.Y. Lam, "OverlapFree KaratsubaOfman Polynomial Multiplication Algorithms," Information Security, IET, vol. 4, pp. 814, Mar. 2010.
[6] M.A. Hasan and V.K. Bhargava, "Division and BitSerial Multiplication over GF($q^m$ )," Proc. IEEE Computers and Digital Techniques, pp. 230236, may 1992.
[7] T. Itoh and S. Tsujii, "Structure of Parallel Multipliers for a Class of Fields ${\rm GF}(2^m)$ ," Information and Computation, vol. 83, pp. 2140, 1989.
[8] A. Karatsuba and Y. Ofman, "Multiplication of Multidigit Numbers on Automata," Soviet PhysicsDoklady, vol. 7, no. 7, pp. 595596, 1963.
[9] N. Koblitz, "Elliptic Curve Cryptosystems," Math. Computation, vol. 48, pp. 203209, 1987.
[10] E. Mastrovito, "VLSI Designs for Multiplication over Finite Fields GF($2^m$ )," Proc. Sixth Int'l Conf. Applied Algebra, Algebraic Algorithm, and ErrorCorrecting Codes (AAECC6), pp. 297309, 1988.
[11] D.A. McGrew and J. Viega, "The Security and Performance of the Galois/Counter Mode (GCM) of Operation," Proc. INDOCRYPT, pp. 343355, 2004.
[12] V. Miller, "Use of Elliptic Curves in Cryptography," CRYPTO '85: Proc. Advances in Cryptology, pp. 417426, 1986.
[13] 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.
[14] A. ReyhaniMasoleh and M.A. Hasan, "A New Construction of MasseyOmura Parallel Multiplier over GF($2^{m}$ )," IEEE Trans. Computers, vol. 51, no. 5, pp. 511520, May 2002.
[15] F. RodriguezHenriquez and C.K. Koç, "Parallel Multipliers Based on Special Irreducible Pentanomials," IEEE Trans. Computers, vol. 52, no. 12, pp. 15351542, Dec. 2003.
[16] A. Satoh, "HighSpeed Parallel Hardware Architecture for Galois Counter Mode," Proc. IEEE Symp. Circuits and Systems (ISCAS), pp. 18631866, 2007.
[17] B. Sunar, "A Generalized Method for Constructing Subquadratic Complexity GF($2^k$ ) Multipliers," IEEE Trans. Computers, vol. 53, no. 9, pp. 10971105, Sept. 2004.
[18] B. Sunar and C. Koc, "Mastrovito Multiplier for All Trinomials," IEEE Trans. Computers, vol. 48, no. 5, pp. 522527, May 1999.
[19] S. Winograd, Arithmetic Complexity of Computations. Soc. For Industrial & Applied Math., 1980.