期刊文献+

一种基于编码的公钥密码体制的参数选择研究 被引量:3

Research on Parameter Selection of a Code-based Public-Key Cryptosystem
下载PDF
导出
摘要 TCHo公钥密码体制是"Trapdoor Cipher,Hardware Oriented"的缩写,是受快速相关攻击中的陷门密码启发而得到的一种基于编码的公钥密码体制。它能抵抗量子计算机的攻击,是一种后量子密码体制。2006年,Finiasz和Vaudenay提出了TCHo公钥密码体制的一种非多项式解密时间的早期版本。2007年,Aumasson等人介绍了使用启发式算法多项式复杂度的TCHo密码体制。2013年,Alexandre和Serge在"Advances in Network Analysis and its Applications"一书中系统介绍了TCHo密码体制。它的安全性基于低重量多项式的倍式问题和带噪声的LFSR区分问题,因此参数的选择决定了密码体制的安全性与可靠性。文章详细介绍了TCHo密码体制,针对TCHo密码体制的参数选择进行了分析,指出该密码体制达到唯一译码的条件,并给出了衡量密码体制可靠性程度的计算公式,同时提出了参数选择的一种方法,从而使密码体制更可靠。 TCHo is short for "Trapdoor Cipher, Hardware Oriented". It is a code-based public- key cryptosystem which is inspired by fast correlation attack. TCHo cryptosystem can resist the attacks from quantum computers which is a post-quantum cryptosystem. An early version was proposed in 2006 by Finiasz and Vaudenay with non-polynomial (though practical) decryption time. The later version came in 2007 with more co-authors. It reached competitive (heuristic) polynomial complexity and IND-CPA security. In 2013, Alexandre and Serge introduces the TCHo cryptosystem in Advances in Network Analysis and its Applications. The security of the cryptosystem relies on the hardness of finding a multiple polynomial with low weight and on the hardness of distinguishing between the out of the LFSR with noise and some random sources, hence, the parameter selection of this cryptosystem determines the security and reliability. This paper introduces the TCHo cryptosystem in detail and analyzes the parameter selection. This paper also points out the condition of achieving the only decoding and discusses the calculation formula for measuring the reliability level of the cryptosystem. At the same time, a method of parameter selection is presented so that the cryptosystem is more reliable.
出处 《信息网络安全》 2014年第10期54-58,共5页 Netinfo Security
基金 国家自然科学基金[11371106]
关键词 公钥密码体制 基于编码的密码体制 后量子密码学 public-key cryptosystem code-based cryptosystem post-quantum cryptography
  • 相关文献

参考文献9

  • 1Shor P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM journal on computing,1997,26(5):1484-1509.
  • 2Finiasz M,Vaudenay S.When stream cipher analysis meets public key cryptography[C]//Selected Areas in Cryptography.Springer Berlin Heidelberg,2007:266-284.
  • 3Vaudenay S,Aumasson J P,Finiasz M,et al.TCHo:a Hardware Oriented Trapdoor Cipher[C]//ACISP" 07:the 12th Australasian Conference on Information Security and Privacy.Springer,2007(LASEC-CONt-2007-053):184-199.
  • 4Duc A,Vaudenay S.TCHo:A Code Based Cryptosystem[C]//.Advances in Network Analysis and its Applications.Springer Berlin Heidelberg,2013:149-179.
  • 5E1 Aimani L,von zur Gathen J.Finding low weight polynomial multiples using lattices[R].Cryptology ePrint Archive,Report 2007/423(2007).
  • 6Canteaut A,Chabaud F.A New Algorithm for Finding Minimum Weight Words in a LinearCode:Application to McEliece' s Cryptosystem and to Narrow-Sense BCH Codes of Length 511[J].IEEE Transactions on Information Theory,1998,44(1):367-378.
  • 7Anscomeb FJ.Large-sample theory of sequential estimation.Proe[M].Cambridge:Cambridge philos,1996.
  • 8Herrmann,M.,Leander,G..A Practical Key Recovery Attack on Basic TCHo[C]// Public Key Cryptography,Lecture Notes in Computer Science,Springer,2009,5443:411-424.
  • 9Fujisaki E,Okamoto T.Secure integration of asymmetric and symmetric encryption schemes[C]//Advances in Cryptology CRYPTO'99.Springer Berlin Heidelberg,1999:537-554.

同被引文献68

  • 1李元兴,王新梅.关于Niederreiter代数码公钥密码体制的安全性及参数优化[J].电子学报,1993,21(7):33-36. 被引量:11
  • 2韩益亮,杨晓元.ECDSA可公开验证广义签密[J].计算机学报,2006,29(11):2003-2012. 被引量:29
  • 3Diffie W, Hellman M E. New directions in cryptography[J]. IEEE Transactions on Information Theory, 1976, 22(6): 644-654.
  • 4Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126.
  • 5Rabin M O. Digitalized signatures and public-key functions as intractable as factorization[R].MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, 1979.
  • 6ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms[C]//Advances in Cryptology. Springer Berlin Heidelberg, 1985: 10-18.
  • 7Miller V. Use of elliptic curves in cryptography[C]//Advances in Cryptology--CRYPTO' 85 Proceedings. Springer Berlin Heidelberg, 1986: 417-426.
  • 8Shamir A. Identity-based cryptosystems and signature schemes[C]// Advances in cryptology. Springer Berlin Heidelberg, 1985: 47-53.
  • 9Boneh D, Franklin M. Identity-based encryption from the Well pairing[C]//Kilian J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213- 229. Springer, Berlin.
  • 10BeUare M, Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols[C]//Proceedings of the 1st ACM conference on Computer and communications security. ACM, 1993: 62-73.

引证文献3

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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