Skip to content
BY-NC-ND 3.0 license Open Access Published by De Gruyter October 5, 2012

Compact McEliece keys based on quasi-dyadic Srivastava codes

  • Edoardo Persichetti EMAIL logo

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.

Received: 2011-03-24
Revised: 2011-11-27
Accepted: 2012-09-08
Published Online: 2012-10-05
Published in Print: 2012-10-01

© 2012 by Walter de Gruyter Berlin Boston

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Downloaded on 1.5.2024 from https://www.degruyter.com/document/doi/10.1515/jmc-2011-0099/html
Scroll to top button