Edoardo Persichetti

IACR Cryptol. ePrint Arch., 2025

Post-Quantum Blind Signatures from Matrix Code Equivalence.

[BibT_eX]

[DOI]

Veronika Kuchta

Jason T. LeGrow

IACR Cryptol. ePrint Arch., 2025

LESS is Even More: Optimizing Digital Signatures from Code Equivalence.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2025

Enhancing Threshold Group Action Signature Schemes: Adaptive Security and Scalability Improvements.

[BibT_eX]

[DOI]

Michele Battagliola

Giacomo Borin

Giovanni Di Crescenzo

Alessio Meneghetti

Proceedings of the Post-Quantum Cryptography - 16th International Workshop, 2025

2024

On the Semidirect Discrete Logarithm Problem in Finite Groups.

[BibT_eX]

[DOI]

Christopher Battarbee

IACR Cryptol. ePrint Arch., 2024

On the hardness of the Lee syndrome decoding problem.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2024

Polynomial Inversion Algorithms in Constant Time for Post-Quantum Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2024, 2024

Cutting the GRASS: Threshold GRoup Action Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2024, 2024

On the Semidirect Discrete Logarithm Problem in Finite Groups.

[BibT_eX]

[DOI]

Christopher Battarbee

Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023

On Linear Equivalence, Canonical Forms, and Digital Signatures.

[BibT_eX]

[DOI]

Tung Chou

IACR Cryptol. ePrint Arch., 2023

Zero-Knowledge Proofs from the Action Subgraph.

[BibT_eX]

[DOI]

Giacomo Borin

IACR Cryptol. ePrint Arch., 2023

On the computational hardness of the code equivalence problem in cryptography.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

Take Your MEDS: Digital Signatures from Matrix Code Equivalence.

[BibT_eX]

[DOI]

Tung Chou

Ruben Niederhagen

Tovohery Hajatiana Randrianarisoa

Krijn Reijnders

Simona Samardjiska

Monika Trimoska

Proceedings of the Progress in Cryptology - AFRICACRYPT 2023, 2023

2022

Reproducible families of codes and cryptographic applications.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2022

Advanced signature functionalities from the code equivalence problem.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2022

Designing a Practical Code-Based Signature Scheme from Zero-Knowledge Proofs with Trusted Setup.

[BibT_eX]

[DOI]

Shay Gueron

Cryptogr., 2022

On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography.

[BibT_eX]

[DOI]

Tovohery Randrianarisoa

Proceedings of the Advances in Information and Computer Security, 2022

2021

On the applicability of the Fujisaki-Okamoto transformation to the BIKE KEM.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2021

Cryptanalysis of a Code-Based Signature Scheme Based on the Schnorr-Lyubashevsky Framework.

[BibT_eX]

[DOI]

Jean-Christophe Deneuville

IEEE Commun. Lett., 2021

A Note on Non-Interactive Key Exchange from Code Equivalence.

[BibT_eX]

[DOI]

Lindsey M. Knowles

Tovohery Randrianarisoa

IACR Cryptol. ePrint Arch., 2021

LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Cryptanalysis of a code-based signature scheme without trapdoors.

[BibT_eX]

[DOI]

Jean-Christophe Deneuville

IACR Cryptol. ePrint Arch., 2021

Cryptanalysis of a code-based full-time signature.

[BibT_eX]

[DOI]

Nicolas Aragon

Jean-Christophe Deneuville

Karan Khathuria

Des. Codes Cryptogr., 2021

LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Security Analysis of a Cryptosystem Based on Subspace Subcodes.

[BibT_eX]

[DOI]

Thierry P. Berger

Anta Niane Gueye

M. Anwarul Hasan

Jean Belo Klamti

Tovohery Hajatiana Randrianarisoa

Olivier Ruatta

Proceedings of the Code-Based Cryptography - 9th International Workshop, 2021

2020

Cryptanalysis of a Code-Based Signature Scheme Based on the Lyubashevsky Framework.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

A New Path to Code-based Signatures via Identification Schemes with Restricted Errors.

[BibT_eX]

[DOI]

Anna-Lena Horlemann-Trautmann

Massimo Battaglioni

Franco Chiaraluce

Violetta Weger

CoRR, 2020

On the Hardness of the Lee Syndrome Decoding Problem.

[BibT_eX]

[DOI]

Violetta Weger

Massimo Battaglioni

Anna-Lena Horlemann-Trautmann

CoRR, 2020

Low-Lee-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Communications, 2020

LESS is More: Code-Based Signatures Without Syndromes.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - AFRICACRYPT 2020, 2020

2019

Tighter proofs of CCA security in the quantum random oracle model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

From Key Encapsulation to Authenticated Group Key Establishment - A Compiler for Post-Quantum Primitives †.

[BibT_eX]

[DOI]

Rainer Steinwandt

Adriana Suárez Corona

Entropy, 2019

Tighter Proofs of CCA Security in the Quantum Random Oracle Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 17th International Conference, 2019

A Reaction Attack Against Cryptosystems Based on LRPC Codes.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - LATINCRYPT 2019, 2019

Improvement of Binary and Non Binary Statistical Decoding Algorithm.

[BibT_eX]

[DOI]

Cheikh Thiécoumba Gueye

Junaid Ahmad Khan

Jean Belo Klamti

Proceedings of the Information Security and Cryptology - ICISC 2019, 2019

DAGS: Reloaded Revisiting Dyadic Key Encapsulation.

[BibT_eX]

[DOI]

Gustavo Banegas

Brice Odilon Boidje

Gilbert Ndollane Dione

Kris Gaj

Cheikh Thiécoumba Gueye

Jefferson E. Ricardini

Proceedings of the Code-Based Cryptography - 7th International Workshop, 2019

2018

Reproducible Codes and Cryptographic Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Towards KEM Unification.

[BibT_eX]

[DOI]

Daniel J. Bernstein

IACR Cryptol. ePrint Arch., 2018

Designing Efficient Dyadic Operations for Cryptographic Applications.

[BibT_eX]

[DOI]

Gustavo Banegas

IACR Cryptol. ePrint Arch., 2018

Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment.

[BibT_eX]

[DOI]

Cryptogr., 2018

On the Performance and Security of Multiplication in GF(2N).

[BibT_eX]

[DOI]

Jean-Luc Danger

Youssef El Housni

Adrien Facon

Cryptogr., 2018

On the CCA2 Security of McEliece in the Standard Model.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, 2018

2017

On lower bounds for information set decoding over q and on the effect of partial knowledge.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2017

Efficient Digital Signatures From Coding Theory.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

DAGS: Key Encapsulation using Dyadic GS Codes.

[BibT_eX]

[DOI]

Gustavo Banegas

Brice Odilon Boidje

Gilbert Ndollane Dione

Kris Gaj

Jefferson E. Ricardini

IACR Cryptol. ePrint Arch., 2017

Code-Based Key Encapsulation from McEliece's Cryptosystem.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

CAKE: Code-Based Algorithm for Key Encapsulation.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

Efficient Implementation of Hybrid Encryption from Coding Theory.

[BibT_eX]

[DOI]

El Hadji Modou Mboup

Ousmane Ndiaye

Proceedings of the Codes, Cryptology and Information Security, 2017

2015

Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice.

[BibT_eX]

[DOI]

Marcin Andrychowicz

Daniel Masny

Proceedings of the Applied Cryptography and Network Security, 2015

2013

Secure and Anonymous Hybrid Encryption from Coding Theory.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

Code-Based Public-Key Encryption Resistant to Key Leakage.

[BibT_eX]

[DOI]

Proceedings of the Security Engineering and Intelligence Informatics, 2013

2012

On a CCA2-secure variant of McEliece in the standard model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Efficient Implementation of a CCA2-Secure Variant of McEliece Using Generalized Srivastava Codes.

[BibT_eX]

[DOI]

Gerhard Hoffmann

Proceedings of the Public Key Cryptography - PKC 2012, 2012

2011

Compact McEliece keys based on Quasi-Dyadic Srivastava codes.

[BibT_eX]

[DOI]