期刊文献+

RSA公开密钥密码体制的密钥生成研究 被引量:1

Generating Strong Primes Study in RSA Cryptosystem
下载PDF
导出
摘要 介绍了密钥生成的一般方法,即确定性素数产生和概率性素数产生方法,并给出了利用 Miller Rabin测试和 Pocklington How to generate strong primes is an important subject in RSA crytosystem. This thesis works at the common generating ways, that is , certain generating algorithms and probabilistic generating algorithms, and demostrates a programming algorithm about how to create strong fake primes based on Miller Rabin tests and Pocklington theorem.
出处 《武汉大学学报(自然科学版)》 CSCD 1999年第3期303-306,共4页 Journal of Wuhan University(Natural Science Edition)
基金 湖北省重点科技基金
关键词 强素数 密码体制 RSA公开密钥 密码学 Pocklington theorem Miller Rabin tests strong primes
  • 相关文献

参考文献1

  • 1Yu Xiuyuan,Elements of Number Theory in Cryptographics(Ch),1993年

同被引文献6

  • 1R L Rivest,A Shamir, L Adelan. A method for obtaining digital signature and public key cryptosystem[ J]. Communications of the ACM,1978,21(2): 120~126.
  • 2T ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms[ J]. IEEE Trans. Info. Theory, 1985,314:469 ~472.
  • 3Y Desmedt, Y Frankel. Shared generation of authenticators and signatures[C]. Advances in Cryptology- CRYPTO' 91,1992,457~469.
  • 4C M Li,T Hwang,N Y lee. Remark on the threshold RSA signature scheme[ C]. Advances in Cryptology - CRYPTO'93,1994,413~420.
  • 5L Harn. Group - oriented( t, 1) threshold digital signature scheme and digital multisignature[ J ]. IEEE Proc. Computers and Digital Techniques, 1994,141(5) :307~313.
  • 6Jan Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem[D]. Vol.2 of ETH Series in Information Security an Cryptography, Hartung- Gorre Verlag Konstanz, 1998.ISBN 3 - 89649 - 286 - 1.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部