9 citations · 15 across the 6 of their papers we have counts for
7 papers
The extended binary quadratic residue code of length 42 holds a 3-design
Alexis Bonnecaze, Patrick Solé
The codewords of weight of the extended binary quadratic residue code are shown to hold a design of parameters Its automorphism group is isomorphi…
Optimization of the scalar complexity of Chudnovsky multiplication algorithms in finite fields
Stephane Ballet, Alexis Bonnecaze, Thanh-Hung Dang
We propose several constructions for the original multiplication algorithm of D.V. and G.V. Chudnovsky in order to improve its scalar complexity. We highlight the set of generic st…
Multiplication in finite fields with Chudnovsky-type algorithms on the projective line
Stéphane Ballet, Alexis Bonnecaze, Bastien Pacifico
We propose a Recursive Polynomial Generic Construction (RPGC) of multiplication algorithms in any finite field based on the method of D.V. and G.V. Chudnovsky sp…
Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3
Kevin Atighehchi, Alexis Bonnecaze
Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all…
On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation
Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze +1
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith respect to the degree o…
On Chudnovsky-Based Arithmetic Algorithms in Finite Fields
Kevin Atighehchi, Stéphane Ballet, Alexis Bonnecaze +1
Thanks to a new construction of the so-called Chudnovsky-Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in f…
On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
Stéphane Ballet, Alexis Bonnecaze, Mila Tukumuli
We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric ve…