default search action
Magali Bardet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Magali Bardet, Rocco Mora
, Jean-Pierre Tillich
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes. IEEE Trans. Inf. Theory 70(6): 4492-4511 (2024) - 2023
- [j5]Magali Bardet, Pierre Briaud
Revisiting algebraic attacks on MinRank and on the rank decoding problem. Des. Codes Cryptogr. 91(11): 3671-3707 (2023) - [i15]Magali Bardet, Rocco Mora, Jean-Pierre Tillich:
Polynomial time attack on high rate random alternant codes. CoRR abs/2304.14757 (2023) - 2022
- [c11]Magali Bardet, Manon Bertin:
Improvement of Algebraic Attacks for Solving Superdetermined MinRank Instances. PQCrypto 2022: 107-123 - [i14]Magali Bardet, Manon Bertin:
Improvement of algebraic attacks for solving superdetermined MinRank instances. CoRR abs/2208.01442 (2022) - [i13]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Jean-Pierre Tillich:
Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem. CoRR abs/2208.05471 (2022) - [i12]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Jean-Pierre Tillich:
Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem. IACR Cryptol. ePrint Arch. 2022: 1031 (2022) - 2021
- [c10]Magali Bardet, Rocco Mora
Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach. ISIT 2021: 872-877 - [c9]Magali Bardet, Pierre Briaud:
An Algebraic Approach to the Rank Support Learning Problem. PQCrypto 2021: 442-462 - [i11]Magali Bardet, Rocco Mora, Jean-Pierre Tillich:
Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach. CoRR abs/2102.02544 (2021) - [i10]Magali Bardet, Pierre Briaud:
An algebraic approach to the Rank Support Learning problem. CoRR abs/2103.03558 (2021) - 2020
- [c8]Magali Bardet, Maxime Bros
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. ASIACRYPT (1) 2020: 507-536 - [c7]Magali Bardet, Pierre Briaud, Maxime Bros
An Algebraic Attack on Rank Metric Code-Based Cryptosystems. EUROCRYPT (3) 2020: 64-93 - [i9]Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray A. Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, Javier A. Verbel:
Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis. CoRR abs/2002.08322 (2020)
2010 – 2019
- 2019
- [c6]Magali Bardet, Manon Bertin, Alain Couvreur, Ayoub Otmani:
Practical Algebraic Attack on DAGS. CBC 2019: 86-101 - [c5]Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha:
Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial. ISIT 2019: 2464-2468 - [i8]Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha:
Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial. CoRR abs/1905.00073 (2019) - [i7]Magali Bardet, Manon Bertin, Alain Couvreur, Ayoub Otmani:
Practical Algebraic Attack on DAGS. CoRR abs/1905.03635 (2019) - [i6]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, Jean-Pierre Tillich:
An Algebraic Attack on Rank Metric Code-Based Cryptosystems. CoRR abs/1910.00810 (2019) - 2016
- [c4]Magali Bardet, Vlad Dragoi
Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme. AFRICACRYPT 2016: 346-367 - [c3]Magali Bardet, Vlad Dragoi
Algebraic properties of polar codes from a new polynomial formalism. ISIT 2016: 230-234 - [c2]Magali Bardet, Julia Chaulet, Vlad Dragoi
Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes. PQCrypto 2016: 118-143 - [i5]Magali Bardet, Vlad Dragoi, Ayoub Otmani, Jean-Pierre Tillich:
Algebraic Properties of Polar Codes From a New Polynomial Formalism. CoRR abs/1601.06215 (2016) - 2015
- [j4]Magali Bardet, Jean-Charles Faugère, Bruno Salvy
On the complexity of the F5 Gröbner basis algorithm. J. Symb. Comput. 70: 49-70 (2015) - 2013
- [j3]Magali Bardet, Jean-Charles Faugère, Bruno Salvy
On the complexity of solving quadratic Boolean systems. J. Complex. 29(1): 53-75 (2013) - [i4]Magali Bardet, Jean-Charles Faugère, Bruno Salvy:
On the Complexity of the F5 Gröbner basis Algorithm. CoRR abs/1312.1655 (2013) - [i3]Magali Bardet, Térence Bayen:
On the degree of the polynomial defining a planar algebraic curves of constant width. CoRR abs/1312.4358 (2013) - 2011
- [j2]Magali Bardet, Islam Boussaada
Complexity reduction of C-Algorithm. Appl. Math. Comput. 217(17): 7318-7323 (2011) - [i2]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the Complexity of Solving Quadratic Boolean Systems. CoRR abs/1112.6263 (2011)
2000 – 2009
- 2009
- [j1]Daniel Augot, Magali Bardet, Jean-Charles Faugère:
On the decoding of binary cyclic codes with the Newton identities. J. Symb. Comput. 44(12): 1608-1625 (2009) - 2007
- [c1]Daniel Augot, Magali Bardet, Jean-Charles Faugère:
On formulas for decoding binary cyclic codes. ISIT 2007: 2646-2650 - [i1]Daniel Augot, Magali Bardet, Jean-Charles Faugère:
On formulas for decoding binary cyclic codes. CoRR abs/cs/0701070 (2007) - 2004
- [b1]Magali Bardet:
Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. Pierre and Marie Curie University, Paris, France, 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: