Andre Weimerskirch, Christof Paar  Home/Search
Context
Related
| iacr.org/2006/224.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this work we generalize the classical Karatsuba Algorithm (KA) for polynomial multiplication to (i) polynomials of arbitrary degree and (ii) recursive use. We determine exact complexity expressions for the KA and focus on how to use it with the least number of operations. We develop a rule for the optimum order of steps if the KA is used recursively. We show how the usage of dummy coe#cients may improve performance. Finally we provide detailed information on how to use the KA with least... (Update)
Similar documents (at the sentence level):
51.2%: Generalizations of the Karatsuba Algorithm for Polynomial.. - Weimerskirch, Paar (Correct)
Active bibliography (related documents): More All
0.5: SFINKS: A Synchronous Stream Cipher for Restricted .. - Braeken, Lano.. (2005) (Correct)
0.2: Multiplicative Complexity of Polynomial Multiplication over.. - Kaminski, Bshouty (1987) (Correct)
0.2: Classification of Some Minimal Quadratic Algorithms for .. - Bshouty, Kaminski.. (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ weimerskirch-generalizations,
author = "Andre Weimerskirch and Christof Paar",
title = "Generalizations of the Karatsuba Algorithm for Efficient Implementations",
url = "citeseer.ist.psu.edu/weimerskirch06generalizations.html" }
Citations (may not include all citations):216 Volume 2: Seminumerical Algorithms (context) - Knuth, of - 1997
56 Fast Fourier Transform and Convolution Algorithms (context) - Nussbaumer - 1982
41 Multiplication of Multidigit Numbers on Automata (context) - Karatsuba, Ofman - 1963
10 the Complexity of Multiplication in Finite Fields (context) - Lempel, Seroussi et al. - 1983
9 Some Bilinear Forms Whose Multiplicative Complexity Depends .. (context) - Winograd - 1977
8 Multidigit Multiplication for Mathematicians - Bernstein
2 cient VLSI Architecture for Bit Parallel Computation in Galo.. (context) - Paar - 1994
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC