Fast arithmetic for polynomials over double-struck F sign 2 in hardware

2006 IEEE Information Theory Workshop, ITW 2006

Volumn , Issue , 2006, Pages 107-111

  Von Zur Gathen, Joachim ^a   Shokrollahi, Jamshid ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT DESIGN TECHNIQUES; FAST ALGORITHMICS; KARATSUBA MULTIPLIERS;

ALGORITHMS; CONSTRAINT THEORY; FIELD PROGRAMMABLE GATE ARRAYS; INFORMATION THEORY; OPTIMIZATION;

POLYNOMIALS;

EID: 33751061273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. V. Bailey and C. Paar, "Optimal extension fields for fast arithmetic in public-key algorithms," in Advances in Cryptology: Proceedings of CRYPTO '98, Santa Barbara CA, ser. Lecture Notes in Computer Science, H. Krawczyk, Ed., no. 1462. Springer-Verlag, 1998, pp. 472-485.
2. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading MA: Addison-Wesley, 1985.
3. D. G. Cantor, "On arithmetical algorithms over finite fields," Journal of Combinatorial Theory, Series A, vol. 50, pp. 285-300, 1989.
4. Digital Signature Standard (DSS), U.S. Department of Commerce / National Institute of Standards and Technology, January 2000, federal Information Processings Standards Publication 186-2.
5. 2," in Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation ISSAC '96, Zürich, Switzerland, Y. N. Lakshman, Ed. ACM Press, 1996, pp. 1-9.
6. _, Modern Computer Algebra, 2nd ed. Cambridge, UK: Cambridge University Press, 2003, first edition 1999.
7. J. von zur Gathen and M. Nöcker, "Polynomial and normal bases for finite fields," Journal of Cryptology, vol. 18, no. 4, pp. 337-355, September 2005.
8. 2," in Selected Areas in Cryptography (SAC 2005). Springer-Verlag, 2005, to appear.
9. 233) multipliers," in Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-03), vol. II, Bangkok, Thailand, May 2003, pp. 268-271.
10. D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. Springer-Verlag, 2003.
11. n)," in Workshop on Cryptographic Hardware and Embedded Systems. Hamburg: IEEE, April 2002.
12. A. Karatsuba and Y. Ofman, "Multiplication of multidigit numbers on automata," Soviet Physics-Doklady, vol. 7, no. 7, pp. 595-596, January 1963
13. translated from Doklady Akademii Nauk SSSR, Vol. 145, No. 2, pp. 293-294, July, 1962.
14. m)," US Patent Application, January 2002.
15. P. L. Montgomery, "Five, Six, and seven-Term Karatsuba-Like Formulae," IEEE Transactions on Computers, vol. 54, no. 3, pp. 362-369, March 2005.
16. C. Paar, "Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields," Ph.D. dissertation, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994.
17. A. Weimerskirch and C. Paar, "Generalizations of the Karatsuba Algorithm for Efficient Implementations," Ruhr-Universität-Bochum, Germany, Tech. Rep., 2003.