default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Briaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Ward Beullens
, Pierre Briaud, Morten Øygarden:
A Security Analysis of Restricted Syndrome Decoding Problems. IACR Commun. Cryptol. 1(3): 33 (2024)- [j2]Loïc Bidoux, Pierre Briaud, Maxime Bros, Philippe Gaborit:
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography. IEEE Trans. Inf. Theory 70(3): 2271-2286 (2024) - [c9]Pierre Briaud, Maxime Bros, Ray A. Perlner, Daniel Smith-Tone:
Practical Attack on All Parameters of the DME Signature Scheme. EUROCRYPT (6) 2024: 3-29 - [c8]Nicolas Aragon, Pierre Briaud, Victor Dyseryn, Philippe Gaborit, Adrien Vinçotte:
The Blockwise Rank Syndrome Learning Problem and Its Applications to Cryptography. PQCrypto (1) 2024: 75-106 - [i14]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) - [i13]Ward Beullens, Pierre Briaud, Morten Øygarden:
A Security Analysis of Restricted Syndrome Decoding Problems. IACR Cryptol. ePrint Arch. 2024: 611 (2024) - [i12]Pierre Briaud:
A Note of Anemoi Gröbner Bases. IACR Cryptol. ePrint Arch. 2024: 693 (2024) - 2023
- [b1]Pierre Briaud:
Cryptanalyse Algébrique de Schémas Post-Quantiques et Hypothèses Associées. (Algebraic Cryptanalysis of Post-Quantum Schemes and Related Assumptions). Sorbone University, France, 2023 - [j1]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Jean-Pierre Tillich:
Revisiting algebraic attacks on MinRank and on the rank decoding problem. Des. Codes Cryptogr. 91(11): 3671-3707 (2023) - [c7]Clémence Bouvier, Pierre Briaud, Pyrros Chaidos, Léo Perrin, Robin Salen, Vesselin Velichkov, Danny Willems:
New Design Techniques for Efficient Arithmetization-Oriented Hash Functions: ttAnemoi Permutations and ttJive Compression Mode. CRYPTO (3) 2023: 507-539 - [c6]Pierre Briaud, Morten Øygarden:
A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions. EUROCRYPT (5) 2023: 391-422 - [c5]Pierre Briaud, Pierre Loidreau:
Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes. PQCrypto 2023: 38-56 - [i11]Pierre Briaud, Morten Øygarden:
A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions. IACR Cryptol. ePrint Arch. 2023: 176 (2023) - [i10]Pierre Briaud, Pierre Loidreau:
Cryptanalysis of rank-metric schemes based on distorted Gabidulin codes. IACR Cryptol. ePrint Arch. 2023: 1008 (2023) - [i9]Nicolas Aragon, Pierre Briaud, Victor Dyseryn, Philippe Gaborit, Adrien Vinçotte:
The Blockwise Rank Syndrome Learning problem and its applications to cryptography. IACR Cryptol. ePrint Arch. 2023: 1875 (2023) - 2022
- [c4]John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and Rainbow. CRYPTO (3) 2022: 376-405 - [i8]Loïc Bidoux, Pierre Briaud, Maxime Bros, Philippe Gaborit:
RQC revisited and more cryptanalysis for Rank-based Cryptography. CoRR abs/2207.01410 (2022) - [i7]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) - [i6]Clémence Bouvier, Pierre Briaud, Pyrros Chaidos, Léo Perrin, Vesselin Velichkov:
Anemoi: Exploiting the Link between Arithmetization-Orientation and CCZ-Equivalence. IACR Cryptol. ePrint Arch. 2022: 840 (2022) - [i5]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]Magali Bardet, Pierre Briaud:
An Algebraic Approach to the Rank Support Learning Problem. PQCrypto 2021: 442-462 - [c2]Pierre Briaud, Jean-Pierre Tillich, Javier A. Verbel:
A Polynomial Time Key-Recovery Attack on the Sidon Cryptosystem. SAC 2021: 419-438 - [i4]Magali Bardet, Pierre Briaud:
An algebraic approach to the Rank Support Learning problem. CoRR abs/2103.03558 (2021) - [i3]Pierre Briaud, Jean-Pierre Tillich, Javier A. Verbel:
A polynomial time key-recovery attack on the Sidon cryptosystem. IACR Cryptol. ePrint Arch. 2021: 929 (2021) - [i2]John Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Improving Support-Minors rank attacks: applications to GeMSS and Rainbow. IACR Cryptol. ePrint Arch. 2021: 1677 (2021) - 2020
- [c1]Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, Jean-Pierre Tillich:
An Algebraic Attack on Rank Metric Code-Based Cryptosystems. EUROCRYPT (3) 2020: 64-93
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-12-02 22:34 CET 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:
