Large integer multiplication is a key operation of cryptography, and its performance affects that of many cryptographic algorithms, such as RSA, ElGamal public key cryptographic algorithms. This paper tests and compares the performance of some frequently used large integer multiplication algorithms and focuses on the Fast Fourier Transform(FFT)multiplication algorithm. It analyzes its advantages and the case where it is preferable and compares its time efficiency to other algorithms. Furthermore, when the d...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
