You are looking at a specific version 20181026:131253 of this paper. See the latest version.

Paper 2018/1029

Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations

Zhe Li and Chaoping Xing and Sze Ling Yeo

Abstract

In this paper, we propose a new general construction to reduce the public key size of McEliece-based schemes based on Goppa codes. In particular, we generalize the ideas of automorphism-induced Goppa codes by considering nontrivial subsets of automorphism groups to construct Goppa codes with a nice block structure. By considering additive and multiplicative automorphism subgroups, we provide explicit constructions to demonstrate our technique. In addition, we show that our technique can be applied to automorphism-induced Goppa codes to further reduce their key sizes.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
McEliece cryptosystemautomorphism-incuded Goppa codesquasi-cyclic
Contact author(s)
lzonline01 @ gmail com
xingcp @ ntu edu sg
slyeo @ i2r a-star edu sg
History
2019-01-15: revised
2018-10-26: received
See all versions
Short URL
https://ia.cr/2018/1029
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.