default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Debris-Alazard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Thomas Debris-Alazard
, Maxime Remaud, Jean-Pierre Tillich:
Quantum Reduction of Finding Short Code Vectors to the Decoding Problem. IEEE Trans. Inf. Theory 70(7): 5323-5342 (2024)- [c12]Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Reduction from Sparse LPN to LPN, Dual Attack 3.0. EUROCRYPT (6) 2024: 286-315 - [c11]Thomas Debris-Alazard, Pierre Loisel, Valentin Vasseur:
Exploiting Signature Leakages: Breaking Enhanced pqsigRM. ISIT 2024: 2903-2908 - [c10]Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé:
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. STOC 2024: 423-434 - [i38]Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé:
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. CoRR abs/2401.03807 (2024) - [i37]André Chailloux, Thomas Debris-Alazard:
New Solutions to Delsarte's Dual Linear Programs. CoRR abs/2405.07666 (2024) - [i36]Thomas Debris-Alazard, Pouria Fallahpour, Damien Stehlé:
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. IACR Cryptol. ePrint Arch. 2024: 30 (2024) - [i35]André Chailloux, Thomas Debris-Alazard:
New Solutions to Delsarte's Dual Linear Programs. IACR Cryptol. ePrint Arch. 2024: 730 (2024) - [i34]Thomas Debris-Alazard, Pierre Loisel, Valentin Vasseur:
Exploiting signature leakages: breaking Enhanced pqsigRM. IACR Cryptol. ePrint Arch. 2024: 1134 (2024) - 2023
- [j2]Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich:
Smoothing Codes and Lattices: Systematic Study and New Bounds. IEEE Trans. Inf. Theory 69(9): 6006-6027 (2023) - [c9]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based Cryptography. ASIACRYPT (7) 2023: 253-283 - [i33]Thomas Debris-Alazard:
Code-based Cryptography: Lecture Notes. CoRR abs/2304.03541 (2023) - [i32]Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Reduction from sparse LPN to LPN, Dual Attack 3.0. CoRR abs/2312.00747 (2023) - [i31]Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Reduction from sparse LPN to LPN, Dual Attack 3.0. IACR Cryptol. ePrint Arch. 2023: 1852 (2023) - 2022
- [j1]Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden:
An Algorithmic Reduction Theory for Binary Codes: LLL and More. IEEE Trans. Inf. Theory 68(5): 3426-3444 (2022) - [c8]Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Statistical Decoding 2.0: Reducing Decoding to LPN. ASIACRYPT (4) 2022: 477-507 - [c7]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
On Codes and Learning with Errors over Function Fields. CRYPTO (2) 2022: 513-540 - [i30]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
On Codes and Learning With Errors over Function Fields. CoRR abs/2202.13990 (2022) - [i29]Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich:
Smoothing Codes and Lattices: Systematic Study and New Bounds. CoRR abs/2205.10552 (2022) - [i28]Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Statistical Decoding 2.0: Reducing Decoding to LPN. CoRR abs/2208.02201 (2022) - [i27]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
ON CODES AND LEARNING WITH ERRORS OVER FUNCTION FIELDS. IACR Cryptol. ePrint Arch. 2022: 269 (2022) - [i26]Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich:
Smoothing Codes and Lattices: Systematic Study and New Bounds. IACR Cryptol. ePrint Arch. 2022: 615 (2022) - [i25]Kévin Carrier, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Jean-Pierre Tillich:
Statistical Decoding 2.0: Reducing Decoding to LPN. IACR Cryptol. ePrint Arch. 2022: 1000 (2022) - [i24]Thomas Debris-Alazard, Nicolas Resch:
Worst and Average Case Hardness of Decoding via Smoothing Bounds. IACR Cryptol. ePrint Arch. 2022: 1744 (2022) - [i23]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
On The Pseudorandomness of the Decoding Problem via the Oracle Comparison Problem. IACR Cryptol. ePrint Arch. 2022: 1751 (2022) - 2021
- [c6]André Chailloux, Thomas Debris-Alazard, Simona Etinski:
Classical and Quantum Algorithms for Generic Syndrome Decoding Problems and Applications to the Lee Metric. PQCrypto 2021: 44-62 - [i22]André Chailloux, Thomas Debris-Alazard, Simona Etinski:
Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric. CoRR abs/2104.12810 (2021) - [i21]Thomas Debris-Alazard, Maxime Remaud, Jean-Pierre Tillich:
Quantum Reduction of Finding Short Code Vectors to the Decoding Problem. CoRR abs/2106.02747 (2021) - [i20]Gustavo Banegas, Thomas Debris-Alazard, Milena Nedeljkovic, Benjamin Smith:
Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. CoRR abs/2110.13488 (2021) - [i19]André Chailloux, Thomas Debris-Alazard, Simona Etinski:
Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric. IACR Cryptol. ePrint Arch. 2021: 552 (2021) - [i18]Thomas Debris-Alazard, Maxime Remaud, Jean-Pierre Tillich:
Quantum Reduction of Finding Short Code Vectors to the Decoding Problem. IACR Cryptol. ePrint Arch. 2021: 752 (2021) - [i17]Gustavo Banegas, Thomas Debris-Alazard, Milena NedeljkoviÄ, Benjamin Smith:
Wavelet: Code-based postquantum signatures with fast verification on microcontrollers. IACR Cryptol. ePrint Arch. 2021: 1432 (2021) - 2020
- [c5]André Chailloux, Thomas Debris-Alazard:
Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. Public Key Cryptography (2) 2020: 453-479 - [i16]Alain Couvreur, Thomas Debris-Alazard, Philippe Gaborit:
On the hardness of code equivalence problems in rank metric. CoRR abs/2011.04611 (2020) - [i15]André Chailloux, Thomas Debris-Alazard:
Tight and Optimal Reductions for Signatures based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. IACR Cryptol. ePrint Arch. 2020: 6 (2020) - [i14]Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden:
An Algorithmic Reduction Theory for Binary Codes: LLL and more. IACR Cryptol. ePrint Arch. 2020: 869 (2020)
2010 – 2019
- 2019
- [b1]Thomas Debris-Alazard:
Cryptographie fondée sur les codes : nouvelles approches pour constructions et preuves ; contribution en cryptanalyse. (Code-based Cryptography: New Approaches for Design and Proof ; Contribution to Cryptanalysis). Pierre and Marie Curie University, Paris, France, 2019 - [c4]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes. ASIACRYPT (1) 2019: 21-51 - [c3]Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne:
Ternary Syndrome Decoding with Large Weight. SAC 2019: 437-466 - [i13]Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne:
Ternary Syndrome Decoding with Large Weight. CoRR abs/1903.07464 (2019) - [i12]Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne:
Ternary Syndrome Decoding with Large Weight. IACR Cryptol. ePrint Arch. 2019: 304 (2019) - [i11]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
About Wave Implementation and its Leakage Immunity. IACR Cryptol. ePrint Arch. 2019: 548 (2019) - 2018
- [c2]Thomas Debris-Alazard, Jean-Pierre Tillich:
Two Attacks on Rank Metric Code-Based Schemes: RankSign and an IBE Scheme. ASIACRYPT (1) 2018: 62-92 - [i10]Thomas Debris-Alazard, Jean-Pierre Tillich:
An attack on a NIST proposal: RankSign, a code-based signature in rank metric. CoRR abs/1804.02556 (2018) - [i9]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
Wave: A New Code-Based Signature Scheme. CoRR abs/1810.07554 (2018) - [i8]Thomas Debris-Alazard, Jean-Pierre Tillich:
A polynomial attack on a NIST proposal: RankSign, a code-based signature in rank metric. IACR Cryptol. ePrint Arch. 2018: 339 (2018) - [i7]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
Wave: A New Code-Based Signature Scheme. IACR Cryptol. ePrint Arch. 2018: 996 (2018) - [i6]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
This is Not an Attack on Wave. IACR Cryptol. ePrint Arch. 2018: 1216 (2018) - 2017
- [c1]Thomas Debris-Alazard, Jean-Pierre Tillich:
Statistical decoding. ISIT 2017: 1798-1802 - [i5]Thomas Debris-Alazard, Jean-Pierre Tillich:
Statistical Decoding. CoRR abs/1701.07416 (2017) - [i4]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
A new signature scheme based on $(U|U+V)$ codes. CoRR abs/1706.08065 (2017) - [i3]André Chailloux, Thomas Debris-Alazard:
A tight security reduction in the quantum random oracle model for code-based signature schemes. CoRR abs/1709.06870 (2017) - [i2]Thomas Debris-Alazard, Nicolas Sendrier, Jean-Pierre Tillich:
A new signature scheme based on (U|U+V) codes. IACR Cryptol. ePrint Arch. 2017: 662 (2017) - [i1]André Chailloux, Thomas Debris-Alazard:
A tight security reduction in the quantum random oracle model for code-based signature schemes. IACR Cryptol. ePrint Arch. 2017: 936 (2017)
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-12 23:02 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:
