Proceedings on Advances in cryptology---CRYPTO '86
Comparison of three modular reduction functions
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Modulo Reduction in Residue Number Systems
IEEE Transactions on Parallel and Distributed Systems
High-precision division and square root
ACM Transactions on Mathematical Software (TOMS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Recent Results on Modular Multiplications for Smart Cards
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
A Survey of Hardware Implementation of RSA (Abstract)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Faster Modular Multiplication by Operand Scaling
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Low-Cost Double-Size Modular Exponentiation or How to Stretch Your Cryptoprocessor
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Increasing the Bitlength of a Crypto-Coprocessor
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
An IWS Montgomery Modular Multiplication Algorithm
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
Applications of fast truncated multiplication in cryptography
EURASIP Journal on Embedded Systems
Efficient 15,360-bit RSA using woop-optimised montgomery arithmetic
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Hardware implementation of tag-reader mutual authentication protocol for RFID systems
Integration, the VLSI Journal
| Hi-index | 0.00 |
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms are presented and adapted to integers. They are based on the most often used n-digit full multiplication algorithms of time complexity O(nα), with 1α ≤ 2, but a constant times faster. For example, the least significant half products with Karatsuba multiplication need only 80% of the full multiplication time. The faster the multiplication, the less relative time saving can be achieved.