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
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
High-precision division and square root
ACM Transactions on Mathematical Software (TOMS)
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Increasing the Bitlength of a Crypto-Coprocessor
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Fast truncated multiplication for cryptographic applications
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Enhanced montgomery multiplication on DSP architectures for embedded public-key cryptosystems
EURASIP Journal on Embedded Systems - Embedded System Design in Intelligent Industrial Automation
| Hi-index | 0.00 |
Truncated multiplications compute truncated products, contiguous subsequences of the digits of integer products. For an n-digit multiplication algorithm of time complexity O(nα), with 1 n-digit modular multiplication on hardware for n-digit half products. For example, Montgomery multiplication is performed in 2.6 Karatsuba multiplication time.