共查询到17条相似文献,搜索用时 62 毫秒
1.
2.
3.
关于Niederreiter代数码公钥密码体制的安全性及参数优化 总被引:1,自引:0,他引:1
本文分析了Niederreiter代数码公钥密码体制(简称为N公钥体制)的安全性,给出了一种攻击N公钥体制的解线性方程组的攻击法.揭示出N公钥体制与McEliece公钥体制(简称M公钥体制)在安全性上是等价的.最后通过对N公钥与M公钥体制在安全性保证下的参数优化,给出这两类体制的参数设计范围与性能比较. 相似文献
4.
基于RS码的改进McEliece公钥密码体制 总被引:1,自引:0,他引:1
论文首先简要介绍了M公钥密码体制,然后重点讨论了基于RS码,利用广义置换矩阵改进的M公钥密码体制,最后对这种改进的M公钥密码体制的安全性进行了分析,证明它的性能和安全性都优于M公钥密码体制。 相似文献
5.
6.
基于代数几何码的公钥密码体制 总被引:3,自引:1,他引:2
提出一种利用代数几何码构造公钥密码体制的新方法,该体制是一种由加密与纠错相结合的加密纠错体制.经过分析,该方法同M公钥体制及其诸多变型相比,在安全性、传信率、纠错能力以及正确解密概率等方面具有一定的优势. 相似文献
7.
8.
9.
本文针对随机错误和突发错误并存的信道,提出了用级联码来构造公钥密码体制的原理和方法。通过对这种体制的安全性、可靠性、码率及实现复杂性等的分析,指出了这种体制有足够高的安全性,有极强的抗干扰能力,且实现复杂性与M_3公钥相近,但它的码率较M_s公钥低,这也说明了在保密通信中,码率与安全性、可靠性是相矛盾的。 相似文献
10.
11.
McEliece公钥体制的修正 总被引:2,自引:0,他引:2
本文针对Korzhik对Turkin公钥密码体制的攻击,对McEliece密码体制提出一种修正方案。分析了它的安全性的其它性能,论证了这些修正方案不仅能有效地抗击Korzhik和Turkin提出的攻击,而且也能很能好地抗击其它已知的攻击方法。 相似文献
12.
The authors encode messages into the error vectors in McEliece's public-key cryptosystem so that its information rate can be significantly increased, and yet do not reduce its security.<> 相似文献
13.
Improving code rate of McEliece's public-key cryptosystem 总被引:1,自引:0,他引:1
A method of improving a code rate of McEliece's public-key cryptosystem is presented. Some information bits are mapped into an artificial error vector to be added to a code-word. The number of information bits is increased by the number of total possible error vectors whose weight is fixed.<> 相似文献
14.
Katz D.J. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(3):964-985
A generalization of McEliece's theorem on the p-adic valuation of Hamming weights of words in cyclic codes is proved in this paper by means of counting polynomial techniques introduced by Wilson along with a technique known as trace-averaging introduced here. The original theorem of McEliece concerned cyclic codes over prime fields. Delsarte and McEliece later extended this to Abelian codes over finite fields. Calderbank, Li, and Poonen extended McEliece's original theorem to cover cyclic codes over the rings Zopf2 d, Wilson strengthened their results and extended them to cyclic codes over Zopf p d, and Katz strengthened Wilson's results and extended them to Abelian codes over Zopfp d. It is natural to ask whether there is a single analogue of McEliece's theorem which correctly captures the behavior of codes over all finite fields and all rings of integers modulo prime powers. In this paper, this question is answered affirmatively: a single theorem for Abelian codes over Galois rings is presented. This theorem contains all previously mentioned results and more 相似文献
15.
Helleseth T. Kumar P.V. Moreno O. Shanbhag A.G. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1996,42(4):1212-1216
An upper hound for Weil-type exponential sums over Galois rings was derived by Kumar, Helleseth, and Calderbank (see ibid., vol.41, no.3, p.456, 1995). This bound leads directly to an estimate for the minimum distance of Z4-linear trace codes. An improved minimum-distance estimate is presented. First, McEliece's result on the divisibility of the weights of binary cyclic codes is extended to Z4 trace codes. The divisibility result is then combined with the techniques of Serre (1983) and of Moreno and Moreno (see ibid., vol.40, no.11, p.1101, 1994) to derive the improved minimum-distance estimate. The improved estimate is tight for the Kerdock code as well as for the Delsarte-Goethals codes 相似文献
16.
17.
基于最大秩距离码的McEliece公钥加密方案 总被引:1,自引:0,他引:1
提出了基于最大秩距离码新的McElience公钥密码系统,讨论其可行性及安全性.证明了它比基于纠错码的McElience公钥密码系统里安全。而且,通过引入单向函数.使密码系统能有效地抗击消息重发攻击和相关消患攻击。 相似文献