Tellegen's principle into practice
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
The Middle Product Algorithm I
Applicable Algebra in Engineering, Communication and Computing
Integer and polynomial multiplication: towards optimal toom-cook matrices
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Short Division of Long Integers
ARITH '11 Proceedings of the 2011 IEEE 20th Symposium on Computer Arithmetic
| Hi-index | 0.00 |
We study the problem of computing middle products of multiple-precision integers. In particular we adapt the Karatsuba polynomial middle product algorithm to the integer case, showing how to efficiently mitigate the failure of bilinearity of the integer middle product noted by Hanrot, Quercia and Zimmermann.