U.S. flag   An unofficial archive of your favorite United States government website
Dot gov

Official websites do not use .rip
We are an unofficial archive, replace .rip by .gov in the URL to access the official website. Access our document index here.

Https

Secure websites use HTTPS
A lock (Dot gov) or https:// means you've safely connected to our website. Please do not share sensitive information with us.

This is an archive
(replace .gov by .rip)

Conference Proceedings

Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems

Published: December 07, 2020

Author(s)

Magali Bardet (Inria), Maxime Bros (Université de Limoges), Daniel Cabarcas (Universidad Nacional de Colombia), Philippe Gaborit (Université de Limoges), Ray Perlner (NIST), Daniel Smith-Tone (NIST), Jean-Pierre Tillich (Inria), Javier Verbel (Universidad Nacional de Colombia)

Conference

Name: 26th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2020)
Dates: December 7-11, 2020
Location: Daejeon, South Korea
Citation: Advances in Cryptology – ASIACRYPT 2020, Lecture Notes in Computer Science vol. 12491, pp. 507-536

Abstract

Keywords

post-quantum cryptography; NIST-PQC candidates; rank metric code-based cryptography; algebraic attack
Control Families

None selected

Documentation

Publication:
Conference Proceedings (DOI)

Supplemental Material:
Preprint (pdf)

Document History:
12/07/20: Conference Proceedings (Final)

Topics

Security and Privacy
post-quantum cryptography