11 citations · 23 across the 5 of their papers we have counts for
5 papers
Faster multiplication over using AVX512 instruction set and VPCLMULQDQ instruction
Jean-Marc Robert, Pascal Véron
Code-based cryptography is one of the main propositions for the post-quantum cryptographic context, and several protocols of this kind have been submitted on the NIST platform. Amo…
A Hole in the Ladder: Interleaved Variables in Iterative Conditional Branching (Extended Version)
Yoann Marquer, Tania Richmond, Pascal Véron
The iterative conditional branchings appear in various sensitive algorithms, like the modular exponentiation in the RSA cryptosystem or the scalar multiplication in ellipticcurve c…
On Polynomial Modular Number Systems over
Jean Claude Bajard, Jérémy Marrez, Thomas Plantard +1
Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic in a sec…
Efficient and secure modular operations using the Adapted Modular Number System
Laurent-Stéphane Didier, Fanga-Yssouf Dosso, Pascal Véron
The Adapted Modular Number System (AMNS) is a sytem of representation of integers to speed up arithmetic operations modulo a prime p. Such a system can be defined by a tuple (p, n,…
Improved code-based identification scheme
Pierre-Louis Cayrel, Pascal Veron
We revisit the 3-pass code-based identification scheme proposed by Stern at Crypto'93, and give a new 5-pass protocol for which the probability of the cheater is 1/2 (instead of 2/…