default search action
Maxime Bros
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Loïc Bidoux
, Pierre Briaud
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography. IEEE Trans. Inf. Theory 70(3): 2271-2286 (2024) - [c4]Pierre Briaud
Practical Attack on All Parameters of the DME Signature Scheme. EUROCRYPT (6) 2024: 3-29 - [i8]Peter Bajcsy, Maxime Bros:
Interactive Simulations of Backdoors in Neural Networks. CoRR abs/2405.13217 (2024) - [i7]Pierre Briaud, Maxime Bros, Ray A. Perlner, Daniel Smith-Tone:
Practical Attack on All Parameters of the DME Signature Scheme. IACR Cryptol. ePrint Arch. 2024: 333 (2024) - 2023
- [j1]Magali Bardet, Pierre Briaud
Revisiting algebraic attacks on MinRank and on the rank decoding problem. Des. Codes Cryptogr. 91(11): 3671-3707 (2023) - 2022
- [b1]Maxime Bros:
Algebraic cryptanalysis and contributions to post-quantum cryptography based on error-correcting codes in the rank-metric. (Cryptanalyse algébrique et contributions à la cryptographie post-quantique basée sur les codes correcteurs d'erreurs en métrique rang). University of Limoges, France, 2022 - [i6]Loïc Bidoux, Pierre Briaud, Maxime Bros, Philippe Gaborit:
RQC revisited and more cryptanalysis for Rank-based Cryptography. CoRR abs/2207.01410 (2022) - [i5]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) - [i4]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
- [c3]Nicolas Aragon, Maxime Bros
Cryptanalysis of the Rank Preserving Signature. IMACC 2021: 45-58 - 2020
- [c2]Magali Bardet, Maxime Bros
Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. ASIACRYPT (1) 2020: 507-536 - [c1]Magali Bardet, Pierre Briaud, Maxime Bros
An Algebraic Attack on Rank Metric Code-Based Cryptosystems. EUROCRYPT (3) 2020: 64-93 - [i3]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) - [i2]Jacques Patarin, Gilles Macario-Rat, Maxime Bros, Eliane Koussa:
Ultra-Short Multivariate Public Key Signatures. IACR Cryptol. ePrint Arch. 2020: 914 (2020)
2010 – 2019
- 2019
- [i1]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)
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-10-07 21:22 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: