Another look at some fast modular arithmetic methods
In this work we re-examine a modular multiplication and a modular exponentiation method. The multiplication method, proposed by Hayashi in 1998, uses knowledge of the factorization of both N + 1 and N + 2 to compute a multiplication modulo N. If both N + 1 and N + 2 can be factored into k equally si...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2009-08-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/JMC.2009.008 |