Improvement of Algebraic Attacks for Solving Superdetermined MinRank Instances

Autor: Magali Bardet, Manon Bertin

Publikováno v: Post-Quantum Cryptography ISBN: 9783031172335

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e1589ce362f45f6b632086ae06f09a1e
https://doi.org/10.1007/978-3-031-17234-2_6

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

Autor: Daniel Cabarcas, Maxime Bros, Javier A. Verbel, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Magali Bardet, Jean-Pierre Tillich

Publikováno v: Advances in Cryptology-ASIACRYPT 2020-26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part {I}
ASIACRYPT 2020-26th International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2020-26th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2020, Daejeon / Virtual, South Korea. pp.507--536, ⟨10.1007/978-3-030-64837-4_17⟩
Advances in Cryptology – ASIACRYPT 2020 ISBN: 9783030648367
ASIACRYPT (1)

Rank Decoding (RD) is the main underlying problem in rank-based cryptography. Based on this problem and quasi-cyclic versions of it, very efficient schemes have been proposed recently, such as those in the ROLLO and RQC submissions, which have reache

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3204392965d4c779f708f06aa51a13a
https://hal.inria.fr/hal-03133479

Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial

Autor: Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha

Publikováno v: 2019 IEEE International Symposium on Information Theory (ISIT)
2019 IEEE International Symposium on Information Theory (ISIT), Jul 2019, Paris, France. pp.2464-2468, ⟨10.1109/ISIT.2019.8849855⟩
ISIT

The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem is referred to as the permutation code equivalence. We show that given

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e90c4fff6a43b370a2c892f08ace0d04
http://arxiv.org/abs/1905.00073

Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme

Autor: Magali Bardet, Ayoub Otmani, Vlad Dragoi, Jean-Gabriel Luque

Publikováno v: AFRICACRYPT 2016 (8th International Conference on Cryptology in Africa)
AFRICACRYPT 2016 (8th International Conference on Cryptology in Africa), Apr 2016, Fes, Morocco. pp.346-367, ⟨10.1007/978-3-319-31517-1_18⟩
Progress in Cryptology – AFRICACRYPT 2016 ISBN: 9783319315164
AFRICACRYPT

International audience; We analyze a new key recovery attack against the Quasi-Cyclic MDPC McEliece scheme. Retrieving the secret key from the public data is usually tackled down using exponential time algorithms aiming to recover minimum weight code

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4e204f3e131418673023bd2f5b4af1c
https://hal-normandie-univ.archives-ouvertes.fr/hal-02087520

Algebraic Properties of Polar Codes From a New Polynomial Formalism

Autor: Ayoub Otmani, Vlad Dragoi, Jean-Pierre Tillich, Magali Bardet

Publikováno v: ISIT
International Symposium on Information Theory ISIT 2016
International Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.230-234, ⟨10.1109/ISIT.2016.7541295⟩

Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These codes are closely related to Reed-Muller codes because both can be de

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c92b24bbd6d1877d13ee74e53666ac83