| 有限域GF（P）上基于FFT的模乘与幂模快速算法 |
| |
| 引用本文： | 杜云.有限域GF（P）上基于FFT的模乘与幂模快速算法[J].六盘水师范高等专科学校学报,2011,23(6):16-21. |
| |
| 作者姓名： | 杜云 |
| |
| 作者单位： | 六盘水师范学院数学系 贵州六盘水553001 |
| |
| 摘 要： | 讨论了基于快速Fourier变换（FFT）的快速模乘和幂模算法，特别是基于快速Fourier变换（FFT）的幂模算法Algorithm FFT_MOD_POWER（1n，n，k），它能通过两次Fourier变换（一次正向Fourier变换和一次逆向Fourier变换）和logk次系数乘法实现n^k。
|
| 关 键 词： | FFT 模幂 模乘 密码算法 |
Modular Multiplication and Modular Exponentiation Algorithm Based on FFT in Finite Field GF(P) |
| |
| DU Yun.Modular Multiplication and Modular Exponentiation Algorithm Based on FFT in Finite Field GF(P)[J].Journal of Liupanshui Teachers College,2011,23(6):16-21. |
| |
| Authors: | DU Yun |
| |
| Institution: | DU Yun (Mathematics Department of Liupanshui Normal College;Liupanshui 553001,China) |
| |
| Abstract: | This paper discusses that modular multiplication and modular exponentiation algorithm based on Fast Fourier Transform,especially the modular exponentiation algorithm based on Fast Fourier Transform ②Algorithm FFT_MOD_POWER(m,n,k),which can be implement of by two Fast Fourier Transforms(including a Fast Fourier Transform and an inverse Fast Fourier Transform) and multiplication of coefficient. |
| |
| Keywords: | Fast Fourier Transform Modular Exponentiation Modular Multiplication Crypto Arithmitic |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
