Efficient Large-Width Montgomery Modular Multiplier Design Based on Toom–Cook-5
Toom–Cook-n multiplication is an efficient large-width multiplication algorithm based on a divide-and-conquer strategy, widely used in modular multiplication operations for cryptographic algorithms. Theoretically, as the degree n increases, Toom–Cook-n can split the multiplicands into more sub-terms...
Saved in:
| Published in: | Electronics (Basel) Vol. 14; no. 7; p. 1402 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Basel
MDPI AG
01.04.2025
|
| Subjects: | |
| ISSN: | 2079-9292, 2079-9292 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!