期刊文献+

一种新的基于多素数RSA认证加密方案 被引量:2

A New Authentication Encryption Scheme Based on Multi-Prime RSA
在线阅读 下载PDF
导出
摘要 根据RSA加密系统和中国剩余定理,提出了一种新的基于多密钥的RSA认证加密方案。该方案与通常的RSA加密系统不同,每个用户只有一个加密密钥,但解密密钥由两个以上的短密钥组成,大大地加快了解密的速度。在解密过程中,巧妙地运用了中国剩余定理,减少了求逆元的个数,提高了效率。特别地,根据该方案可得到改进的Paixao方案和Boneh方案,计算速度更快,效果更好。分析表明,此方案可以有效地减少计算复杂度,并且不会降低其安全性,十分适合智能卡之间、智能卡和终端之间的认证和信息交换。 In this paper, a new authentication encryption scheme based on multi private key RSA and the Chinese Remainder Theorem (CRT) is proposed. The difference from usual encryption system is that each user has only one encryption key,and the decryption key is composed of over two short keys. Whats more, during decryption process,CRT is used artfully ,thus ,the number of multiplicable reverse is decreased.So the benefit of decryption is improved faster greatly. Specially, improved Paixao scheme and Boneh scheme can be obtained from this paper, which achieves high efficiency. Analysis shows that the scheme can reduce the computing complexity and would not reduce its security performance .It is very suitable for information communication between smart carts or between smart carts and terminals.
出处 《计算机应用研究》 CSCD 北大核心 2005年第5期105-107,共3页 Application Research of Computers
基金 国家自然科学基金资助项目 ( 60173038 69873020) 广东省自然科学基金资助项目(010421 000759)
关键词 多密钥RSA 中国剩余定理 认证加密 智能卡 Multi Private Key RSA the Chinese Remainder Theorem (CRT) Authentication Encryption Smart Cart
  • 相关文献

参考文献9

  • 1R L Rivest, A Shamir, L Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems[J]. Communications of the ACM, 1978,21(2): 120-126.
  • 2Arjen K Lenstra, Eric R Verheul. Selecting Cryptographic Key Sizes [J]. Journal of Cryptology, 2001, 14(4): 255-293.
  • 3D M Gordon. A Survey of Fast Exponentiation Methods[J]. Journal of Algorithms, 1998,27:129-146.
  • 4D Boneh, H Shacham. Fast Variants of RSA[R]. RSA Laboratories Cryptobytes, 2002,5(1) :1-8.
  • 5Cesar A M Paixao. An Efficient Variant of the RSA Cryptosystem [EB/OL]. Institute of Mathematics and Statistics University of Sao Paulo, Brazil, http://www.ime.usp.br/~capaixao/paper.pdf,2003.
  • 6M J Hinek, M K Low, E Teske. On Some Attacts on Multy-prime RSA [EB/OL]. The Centre for Applied Cryptographic Research (CACR) at the University of Waterloo, Department of Combinatorics and Optimization, Ontario, Canada. http://www.cacr.math.uwaterloo.ca/ techreports / 2002/corr2002-11.ps,2002.
  • 7M Joye, P Paillier. How to Use RSA; or How to Improve the Efficiency of RSA Without Loosing Its Security[C]. Paris, France:2002 Information Security Solutions Europe Conference (ISSE2002), 2002.
  • 8D Boneh, X Ding, G Tsudik, et al. A Method for Fast Revocation of Public Key Certificates and Security Capabilities[C]. Washington, D.C., USA:the 10th USENIX Security Symposium,2001.297-308.
  • 9X Ding, G Tsudik. Simple Identity-based Encryption with Mediated RSA[C]. San Francisco,CA, USA:2003 Cryptographer's Track RSA Conference, 2003.193-210.

同被引文献18

  • 1李树栋.一个新的可公开验证的认证加密方案[J].烟台职业学院学报,2007(2):55-57. 被引量:1
  • 2黄益栓,卢建朱.一种基于身份的认证加密新方案[J].计算机工程,2007,33(7):149-150. 被引量:8
  • 3AJTAI M. Generating hard instances of lattice problems[ C ]//Proc ofthe 28th Annual ACM Symposium on Theory of Computing. New York : ACM Press, 1996:99-108.
  • 4REGEV O. The learning with errors problem[ EB/OL]. http ://www. cs. tan. ac. iV odedr/papers/lwasurvey, pdf.
  • 5BLUM A, KALAI A, WASSERMAN H. Noise-tolerant learning, the parity problem, and she statistical query model [ J]. Journal of the ACM ,2003,50(4) :506-519.
  • 6ARORA S, GE Rong. New algorithms for learning in presence of er- rors [ C ]//Proc of the 38th International Colloquim Conference on Au- tomata, Languages and Programming, Volume Part I. 2011:4-03-415.
  • 7REGEV O. On lattices, learning with errors, random linear codes and cryptography [J]. Journal of the AGM,2009,56(6) :34.
  • 8LYUBASHEVSKY V, PEIKERT C, REGEV O. On ideal lattices and learning with errors over tings [ C ]//Proc of the 29th Annual Interna- tional Conference on the Theory and Applications of Cryptographic Techniques. Berlin : Springer-Verlag, 2010 : 1 - 23.
  • 9MICCIANCIO D. Generalized compact knapsacks, cyclic lattices, and efficient one way functions [ J ]. Computational Complexity, 2007,16(4) :411.
  • 10LYUBASHEVSKY V, MICCIANCIO D. Generalized compact knap- sacks are collision resistant[ C ]//Lecture Notes in Computer Science, vol 4052. Berlin : Springer-Verlag,2006 : 144-155.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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