DAGS: Key encapsulation using dyadic GS codes

Journal of mathematical cryptology

article

Gustavo Banegas¹  Ousmane N’diaye²  Duc Tri Nguyen³  Edoardo Persichetti⁴  Jefferson E. Ricardini⁵  Paulo S. L. M. Barreto⁶  Brice Odilon Boidje²  Pierre-Louis Cayrel⁷  Gilbert Ndollane Dione²  Kris Gaj³  Cheikh Thiécoumba Gueye²  Richard Haeussler³  Jean Belo Klamti² 

[1]Technische Universiteit Eindhoven

[2]Laboratoire d’Algebre, Université Cheikh Anta Diop

[3]George Mason University

[4]Department of Mathematical Sciences, Florida Atlantic University

[5]Universidade de São Paulo

[6]University of Washington Tacoma

[7]Laboratoire Hubert Curien, Université Jean Monnet

关键词: Post-quantum cryptography;    code-based cryptography;    key exchange;   

DOI  :  10.1515/jmc-2018-0027

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

来源: De Gruyter

【 摘 要 】

Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes. The scheme is proved to be IND-CCA secure in both random oracle model and quantum random oracle model. We believe that DAGS will offer competitive performance, especially when compared with other existing code-based schemes, and represent a valid candidate for post-quantum standardization.

【 授权许可】

CC BY|CC BY-NC-ND