首页> 外文会议>IEEE International Conference on Communication Software and Networks >A new decryption algorithm of the quasi-cyclic low-density parity-check codes based McEliece cryptosystem
【24h】

A new decryption algorithm of the quasi-cyclic low-density parity-check codes based McEliece cryptosystem

机译:基于McEliece密码系统的准循环低密度奇偶校验码的新解密算法

获取原文

摘要

The McEliece public-key cryptosystem is believed to resist quantum attacks, but has not been used because of the extremely large public key size. In order to decrease the public key size, quasi-cyclic low-density parity-check (QC-LDPC) codes were used instead of Goppa codes in McEliece cryptosystem. A modified version of QC-LDPC McEliece is quasi-cyclic moderate density parity-check (QC-MDPC) McEliece, which focuses on ensuring fixed security level other than error-correction capability. The QC-MDPC McEliece scheme furtherly reduces the public key size at the cost of higher decryption complexity. However, the decryption algorithm of QC-LDPC McEliece variant has not been optimized. In this paper, we proposed a new decryption algorithm of the QC-LDPC McEliece variant. With the decryption algorithm we proposed, the key size reduces about 20% than the original algorithm, even 8% smaller than QC-MDPC variant.
机译:McEliece公钥密码系统被认为可以抵抗量子攻击,但由于其极大的公钥大小而未被使用。为了减小公钥大小,在McEliece密码系统中使用了准循环低密度奇偶校验(QC-LDPC)码代替Goppa码。 QC-LDPC McEliece的修改版本是准循环中等密度奇偶校验(QC-MDPC)McEliece,其重点是确保固定的安全级别而不是纠错能力。 QC-MDPC McEliece方案以更高的解密复杂性为代价进一步减小了公钥的大小。但是,QC-LDPC McEliece变体的解密算法尚未优化。在本文中,我们提出了一种新的QC-LDPC McEliece变体的解密算法。使用我们提出的解密算法,密钥大小比原始算法减少了约20%,甚至比QC-MDPC变体小了8%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号