Optimisation of big N-width digits multiplication based on N-width DFT
It is considered multidigit multiplication, that has biggest influence on asymmetric cryptography performance. It is given detailed description of N-digit multiplication algorithm that is based on FFT of the length of N using of "unpacking" and "packing" formulas....
Збережено в:
| Дата: | 2015 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | Російська |
| Опубліковано: |
PROBLEMS IN PROGRAMMING
2015
|
| Теми: | |
| Онлайн доступ: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/113 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Problems in programming |
| Завантажити файл: |  |
Репозитарії
Problems in programming| Резюме: | It is considered multidigit multiplication, that has biggest influence on asymmetric cryptography performance. It is given detailed description of N-digit multiplication algorithm that is based on FFT of the length of N using of "unpacking" and "packing" formulas. It is given description, that gives possibility to build more simpler algorithm with using only either "unpacking" or "packing" operations. |
|---|