| 关于有限域(F)p上多项式RSA的安全性和RSA的新模拟 |
| |
| 引用本文： | 曹珍富.关于有限域(F)p上多项式RSA的安全性和RSA的新模拟[J].通信学报,1999,20(6):15-18. |
| |
| 作者姓名： | 曹珍富 |
| |
| 作者单位： | 哈尔滨工业大学数学系,哈尔滨150001 |
| |
| 摘 要： | 本文首先指出有限域Ｆｐ上多项式ＲＳＡ是不安全的，然后给出了ＲＳＡ在Ｚｒ（ｒ＝ｐｑ）中的两个新模拟。两个新体制的安全性将主要基于大整数的分解
|
| 关 键 词： | RSA 安全性 分解 有限域上的多项式 |
On the Security of the RSA Based on a Polynomial Over Finite Fields (F)p and a New Analog of the RSA |
| |
| Cao Zhenfu.On the Security of the RSA Based on a Polynomial Over Finite Fields (F)p and a New Analog of the RSA[J].Journal on Communications,1999,20(6):15-18. |
| |
| Authors: | Cao Zhenfu |
| |
| Abstract: | First,we show that the RSA based on a polynomial over finite fields F)p is not
secure.Next,we presents a new analog of the RSA.The security of the new cryptosystems main
based on the factorization of large integers. |
| |
| Keywords: | RSA security factorization polynomial over finite field |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
