The Improved McEliece PKC and its Security Analysis

Si Min Liu; Jun Yao Ye

doi:10.4028/www.scientific.net/AMR.962-965.2814

Paper Titles

Investigation of Particle Flow Field in Pyrotechnic Flame Based on Particle Image and Particle Velocity
p.2789

Research on Aluminum-Plastic Blister Drug Image Segmentation Method Based on Improved Otsu Theory
p.2797

Research on Performance Detection and Evaluation Platform Based on Data Analyzation
p.2801

Spatial Point Reconstruction Based on Binocular Stereo Vision
p.2809

The Improved McEliece PKC and its Security Analysis
p.2814

The Prediction of Bus Speed Based on Kalman Filter
p.2818

The Rules of Beijing Metro Passenger Flow Based on AFC Data
p.2823

Oil Analysis Cost-Effective Compressor Condition Computer Monitoring Technique
p.2827

Research on Improvement of Non-DEA Efficient Units
p.2831

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 962-965The Improved McEliece PKC and its Security...

The Improved McEliece PKC and its Security Analysis

Abstract:

Because the decoding problem of general linear codes is an NPC problem, at the same time Goppa codes have fast decoding algorithm, McEliece first proposed a public-key cryptosystem based on error-correcting codes. This paper constructs the largest distance codes based on metric, then improves the McEliece cryptosystem based on the largest distance codes. We've proved that the cryptosystem is able to resist the attack of getting the private key by a known public key. Finally, through the analysis of existing viable attack method, we proved the feasibility and security of the improved McEliece cryptosystem.

You might also be interested in these eBooks

Resources and Sustainable Development III

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 962-965)

Pages:

2814-2817

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.962-965.2814

Citation:

Cite this paper

Online since:

June 2014

Authors:

Si Min Liu, Jun Yao Ye*

Keywords:

Goppa Code, McEliece PKC, NPC Problem, Security Analysis

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] McElience R J. A Public-key Cryptosystem Based on Algebraic Coding Theory[R]. Jet Propulsion Lab. DSN Progress Reprot. (1978).

Google Scholar

[2] Gabidulin E M. Theory of Code with Maximum Rank Distance[J]. Problem of Information Tarnsmission, 1985, 21(1): 1-12.

Google Scholar

[3] Gabidulin E M, Paramonov A V, Tretjakov O V. Ideals over a Non-Commutative Ring and their Application in Cryptology[A]. Proceeding of EUROCRYP'91, Lecture Notes in Computer Science[C]. Springer-Verlag, 1991: 482-489.

DOI: 10.1007/3-540-46416-6_41

Google Scholar

[4] Overbeck R. Structural Attack for Public key Cryptosystems based on Gabidulin Codes[J]. Journal of Cryptology, 2008, 21: 280-301.

DOI: 10.1007/s00145-007-9003-9

Google Scholar

[5] Gabidulin E M, Simonis J. Metrics Generated by Families of Subspace[J]. IEEE Trans. Inf. Theory, 1998, 44(5): 1336-1341.

DOI: 10.1109/18.669429

Google Scholar

[6] P.J. Lee E.F. Briekell. All observation on the security of McEliece's Public-key cryptosystem. Lecture Notes in Computer Science on Advances in Cryptology EUROCRYPT88, 1988, 275-280.

Google Scholar

[7] Al-Riyami S, Paterson K. CBE from CL-PKE: A Generic Construction and Efficient Schemes[J]. PKC 2005, LNCS, 2005, 3386: 398一415.

DOI: 10.1007/978-3-540-30580-4_27

Google Scholar

[8] Libert B. On construeting certificateless cryptosystems from identity base Encryption[J]. PKC2006, LNCS, 2006, 3958: 474-490.

Google Scholar