Improved three-way split formulas for binary polynomial and Toeplitz matrix vector products

IEEE Transactions on Computers

Volumn 62, Issue 7, 2013, Pages 1345-1361

  Cenk, Murat ^a   Negre, Christophe ^a   Hasan, M Anwar ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITÉ DE PERPIGNAN   (France)

Author keywords

Binary polynomial; finite field; subquadratic space complexity multiplier; Toeplitz matrix

Indexed keywords

FIELD EXTENSIONS; FINITE FIELDS; POLYNOMIAL MULTIPLICATION; SPACE COMPLEXITY; THREE-WAY SPLIT; TOEPLITZ MATRICES; TOEPLITZ MATRIX VECTOR PRODUCTS;

MATRIX ALGEBRA;

POLYNOMIALS;

EID: 84878396949     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2012.96     Document Type: Article

References (14)

1. D.J. Bernstein, "Batch Binary Edwards," Proc. 29th Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '09), vol. 5677, pp. 317-336, 2009.
2. M. Cenk, Ç. Koç, and F. Ozbudak, "Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation," Proc. IEEE 19th Symp. Computer Arithmetic, (ARITH '09), pp. 84-91, 2009.
3. M. Cenk, C. Negre, and M.A. Hasan, "Improved Three-Way Split Formulas for Binary Polynomial Multiplication," Proc. 18th Int'l Conf. Selected Areas in Cryptography (SAC '11), 2011.
4. T. ElGamal, "A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," IEEE Trans. Information Theory, vol. TIT-31, no. 4, pp. 469-472, July 1985.
5. 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. 224-233, Sept. 2007. (Pubitemid 46062877)
6. H. Fan, J. Sun, M. Gu, and K.-Y. Lam, "Overlap-Free Karatsuba- Ofman Polynomial Multiplication Algorithm," IET Information Security, vol. 4, no. 1, pp. 8-14, 2010.
7. M.A. Hasan, N. Me'loni, A.H. Namin, and C. Negre, "Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product," IEEE Trans. Computers, vol. 61, no. 2, pp. 151-163, Feb. 2012.
8. A.A. Karatsuba, "The Complexity of Computations," Proc. Steklov Inst. of Math., vol. 211, pp. 169-183, 1995.
9. N. Koblitz, "Elliptic Curve Cryptosystems," Math. of Computation, vol. 48, pp. 203-209, 1987.
10. D.A. McGrew and J. Viega, "The Security and Performance of the Galois/Counter Mode (GCM) of Operation," Proc. Int'l Conf. Cryptology (INDOCRYPT), pp. 343-355, 2004. (Pubitemid 39748319)
11. V. Miller, "Use of Elliptic Curves in Cryptography," Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '85), vol. 218, pp. 417-426, 1986.
12. B. Sunar, "A Generalized Method for Constructing Subquadratic Complexity GF(2k) Multipliers," IEEE Trans. Computers, vol. 53, no. 9, pp. 1097-1105, Sept. 2004.
13. A.L. Toom, "The Complexity of a Scheme of Functional Elements Realizing the Multiplication of Integers," Soviet Math., vol. 3, pp. 714-716, 1963.
14. S. Winograd, Arithmetic Complexity of Computations. Soc. for Industrial and Applied Math., 1980.