Browse > Article

An Efficient Architecture for Modified Karatsuba-Ofman Algorithm  

Chang Nam-Su (Center for Information and Security Technologies (CIST), Korea Univ.)
Kim Chang-Han (Dept. of Information and Security, Semyung Univ.)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.43, no.3, 2006 , pp. 33-39 More about this Journal
Abstract
In this paper we propose the Modified Karatsuba-Ofman algorithm for polynomial multiplication to polynomials of arbitrary degree. Leone proposed optimal stop condition for iteration of Karatsuba-Ofman algorithm(KO). In this paper, we propose a Non-Redundant Karatsuba-Ofman algorithm (NRKOA) with removing redundancy operations, and design a parallel hardware architecture based on the proposed algorithm. Comparing with existing related Karatsuba architectures with the same time complexity, the proposed architecture reduces the area complexity. Furthermore, the space complexity of the proposed multiplier is reduced by 43% in the best case.
Keywords
Polynomial Multiplication; Karatsuba-Ofman Algorithm; Non-Redundant Karatsuba-Ofman Algorithm; Hardware Architecture;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 F. Rodriguez-Henriquez and C. K. Koc, 'On fully parallel Karatsuba multipliers for GF($2^m)', Proceedings of the international Conference on Computer Science and Technology -CST 2003, Acta Press, Cancun, Mexico, May 2003, 405-410
2 M. Ernst, M. Jung, F. Madlener, S. Huss, and R. Blumel, 'A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF($2^n$)', In Work shop on Cryptographic Hardware and Embedded Systems (CHES'02), LNCS2523, (2002), 381-399
3 N. Koblitz, 'Elliptic Curve Cryptosysterns', Mathematics of Computation, vol. 48, 1987, 203-209   DOI
4 M. Leone, 'A New Low Complexity Parallel Multiplier for a Class of Finite Fields', In Workshop on Cryptographic Hardware and Embedded Systems (CHES'01), LNCS2162, (2001), 160-170
5 C. Paar, 'A new architecture for a parallel finite fields multiplier with Low Complexity Based on Composite Fields', IEEE Trans. on Computers, vol45, no.7, July 1996, 846-861   DOI   ScienceOn
6 장남수, 한동국, 정석원, 김창한, '유한체 GF($2^N$)에서 낮은 공간 복잡도를 가지는 새로운 다중 분할 카라슈바 방법의 병렬 처리 곱셈기', 대한전자공학회논문지(SC), 41. 1, pp.33-40, 2004   과학기술학회마을
7 G. Drolet, 'A New Representation of Elements of Finite Fields GF($2^m$) Yielding Small Complexity Arithmetic circuit}, IEEE Trans. on Computers, vol 47, 1998, 353-356   DOI   ScienceOn
8 장남수, 김창한, '확장체 GF($P^n$)에서 효율적인 다항식 곱셈 방법', 대한전자공학회논문지(SD), 42. 5, pp.23-30, 2005   과학기술학회마을