Skip to main content
Article
DAGS: Key Encapsulation Using Dyadic GS Codes
Journal of Mathematical Cryptology
  • G. Banegas
  • Paulo Barreto, University of Washington Tacoma
  • B.O. Boidje
  • P.-L. Cayrel
  • G.N. Dione
  • K. Gaj
  • C.T. Gueye
  • R. Haeussler
  • J.B. Klamti
  • O. N'Diaye
  • D.T. Nguyen
  • E. Persichetti
  • J.E. Ricardini
Publication Date
1-1-2018
Document Type
Article
Abstract

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. © 2018 Walter de Gruyter GmbH, Berlin/Boston.

Publisher Policy
pre print, post print (12 month embargo)
Citation Information
Banegas, G., Barreto, P. S. L. M., Boidje, B. O., Cayrel, P.-L., Dione, G. N., Gaj, K., … Ricardini, J. E. (2019). DAGS: Reloaded Revisiting Dyadic Key Encapsulation. In M. Baldi, E. Persichetti, & P. Santini (Eds.), Code-Based Cryptography (pp. 69–85). https://doi.org/10.1007/978-3-030-25922-8_4