Pascal Véron

J. Cryptogr. Eng., April, 2023

2022

PMNS for Efficient Arithmetic and Small Memory Cost.

[BibT_eX]

[DOI]

Jean-Marc Robert

IEEE Trans. Emerg. Top. Comput., 2022

Faster multiplication over F<sub>2</sub>[X] using AVX512 instruction set and VPCLMULQDQ instruction.

[BibT_eX]

[DOI]

Jean-Marc Robert

CoRR, 2022

2021

A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version).

[BibT_eX]

[DOI]

Yoann Marquer

Tania Richmond

CoRR, 2021

Compact Variable-base ECC Scalar Multiplication using Euclidean Addition Chains.

[BibT_eX]

[DOI]

Fabien Herbaut

Nicolas Méloni

Proceedings of the 18th International Conference on Security and Cryptography, 2021

2020

Efficient modular operations using the adapted modular number system.

[BibT_eX]

[DOI]

Laurent-Stéphane Didier

J. Cryptogr. Eng., 2020

On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Efficient and secure modular operations using the Adapted Modular Number System.

[BibT_eX]

[DOI]

Laurent-Stéphane Didier

CoRR, 2019

Randomization of Arithmetic Over Polynomial Modular Number System.

[BibT_eX]

[DOI]

Laurent-Stéphane Didier

Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

2018

Euclidean addition chains scalar multiplication on curves with efficient endomorphism.

[BibT_eX]

[DOI]

J. Cryptogr. Eng., 2018

2017

Cache timing attacks countermeasures and error detection in Euclidean addition chains based scalar multiplication algorithm for elliptic curves.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on On-Line Testing and Robust System Design, 2017

2016

Extended security arguments for signature schemes.

[BibT_eX]

[DOI]

Özgür Dagdelen

David Galindo

Sidi Mohamed El Yousfi Alaoui

Des. Codes Cryptogr., 2016

2013

Code Based Cryptography and Steganography.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012

An Improved Threshold Ring Signature Scheme Based on Error Correcting Codes.

[BibT_eX]

[DOI]

Sidi Mohamed El Yousfi Alaoui

Gerhard Hoffmann

Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

2011

Guest editorial for the special issue for Jacques Wolfmann.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2011

2010

Improved code-based identification scheme

[BibT_eX]

[DOI]

CoRR, 2010

A Public Key Cryptosystem Based upon Euclidean Addition Chains.

[BibT_eX]

[DOI]

Fabien Herbaut

Proceedings of the Sequences and Their Applications - SETA 2010, 2010

A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem.

[BibT_eX]

[DOI]

Sidi Mohamed El Yousfi Alaoui

Proceedings of the Selected Areas in Cryptography - 17th International Workshop, 2010

Random Euclidean Addition Chain Generation and Its Application to Point Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

2005

Proof of Conjectures on the True Dimension of Some Binary Goppa Codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

On the Non-linearity of Power Functions.

[BibT_eX]

[DOI]

Philippe Langevin

Des. Codes Cryptogr., 2005

2001

True Dimension of Some Binary Quadratic Trace Goppa Codes.

[BibT_eX]

Des. Codes Cryptogr., 2001

1998

Goppa Codes and Trace Operator.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

1996

Improved identification schemes based on error-correcting codes.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1996

1995

Cryptanalysis of Harari's Identification Scheme.

[BibT_eX]

[DOI]