An efficient structural attack on NIST submission DAGS
classification
💻 cs.CR
cs.ITmath.IT
keywords
attackdagsefficientnistalternantbreakcodecodes
read the original abstract
We present an efficient key recovery attack on code based encryption schemes using some quasi-dyadic alternant codes with extension degree 2. This attack permits to break the proposal DAGS recently submitted to NIST.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.