2 search results - page 1 / 1 » Improved ZDN-arithmetic for Fast Modulo Multiplication |
ICCD
2001
IEEE
14 years 1 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...