( en | de | ru )

 

Disambiguation of "Resch, Nicolas"

Author of the publication

copydeleteadd this publication to your clipboard
Smoothing Codes and Lattices: Systematic Study and New Bounds.

, , , and . IACR Cryptol. ePrint Arch., (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Resch

Helmut Resch

Armin Resch

Karl Resch

Günter Resch

 

Other publications of authors with the same name

A Generalized Special-Soundness Notion and its Knowledge Extractors., , and . IACR Cryptol. ePrint Arch., (2023)Worst and Average Case Hardness of Decoding via Smoothing Bounds., and . IACR Cryptol. ePrint Arch., (2022)Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness., , and . TCC (3), volume 14371 of Lecture Notes in Computer Science, page 424-454. Springer, (2023)On List Recovery of High-Rate Tensor Codes., , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 68:1-68:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography., , and . CoRR, (January 2025)Blaze: Fast SNARKs from Interleaved RAA Codes., , , , , and . EUROCRYPT (4), volume 15604 of Lecture Notes in Computer Science, page 123-152. Springer, (2025)Worst and Average Case Hardness of Decoding via Smoothing Bounds., and . PKC (2), volume 15675 of Lecture Notes in Computer Science, page 363-392. Springer, (2025)LDPC Codes Achieve List Decoding Capacity., , , , and . FOCS, page 458-469. IEEE, (2020)Smoothing Codes and Lattices: Systematic Study and New Bounds., , , and . IACR Cryptol. ePrint Arch., (2022)Blaze: Fast SNARKs from Interleaved RAA Codes., , , , , and . IACR Cryptol. ePrint Arch., (2024)