Compact McEliece keys based on quasi-dyadic Srivastava codes

Journal of mathematical cryptology

article

Edoardo Persichetti¹ 

[1] Department of Mathematics, University of Auckland

关键词: Cryptography;    coding theory;    McEliece;   

DOI  :  10.1515/jmc-2011-0099

学科分类：社会科学、人文和艺术（综合）

来源: De Gruyter

【 摘 要 】

Abstract. The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the public key size. Previous proposals tried to replace the class of Goppa codes with other families of codes, but this was revealed to be an insecure choice. In this paper we introduce a construction based on Generalized Srivastava codes, a large class which includes Goppa codes as a special case, that allows relatively short public keys without being vulnerable to known structural attacks.

【 授权许可】

CC BY|CC BY-NC-ND