Papers
Topics
Authors
Recent
Search
2000 character limit reached

An efficient structural attack on NIST submission DAGS

Published 14 May 2018 in cs.CR, cs.IT, and math.IT | (1805.05429v2)

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.

Citations (18)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Elise Barelli 
  2. Alain Couvreur 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up