1. Banegas, G., et al.: DAGS: key encapsulation using dyadic GS codes. J. Math. Cryptology 12(4), 221–239 (2018)
2. Banegas, G., et al.: DAGS: Key encapsulation for dyadic GS codes, specifications v2, September 2018
3. Banegas, G., et al.: DAGS: Key encapsulation for dyadic GS codes, November 2017.
https://csrc.nist.gov/CSRC/media/Projects/Post-Quantum-Cryptography/documents/round-1/submissions/DAGS.zip
. First round submission to the NIST post-quantum cryptography call
4. Bardet, M., Faugère, J.C., Salvy, B.: On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations. In: International Conference on Polynomial System Solving, ICPSS 2004, 24–26 November, Paris, France, pp. 71–75 (2004)
5. Bardet, M., Faugère, J.C., Salvy, B., Yang, B.Y.: Asymptotic behaviour of the degree of regularity of semi-regular quadratic polynomial systems. In: MEGA 2005 Eighth International Symposium on Effective Methods in Algebraic Geometry, Porto Conte, Alghero, Sardinia, Italy, p. 15, 27 May–1 June 2005