An efficient structural attack on NIST submission DAGS
arXiv:1805.05429v220 citations
Originality Incremental advance
AI Analysis
This work addresses a security vulnerability in a post-quantum cryptography candidate for standardization, but it is incremental as it builds on known structural weaknesses in specific codes.
The authors tackled the problem of breaking the DAGS code-based encryption scheme submitted to NIST by developing an efficient key recovery attack, which successfully compromises the proposal.
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.