Robert Rolland
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Robert Rolland has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Stéphane Ballet
Institut de Mathématiques de Marseille
8 shared publications - Kevin Atighehchi
Aix Marseille Univ CNRS LIF Marseille France
4 shared publications - Alexis Bonnecaze
AB and PS are with Aix Marseille Univ CNRS Centrale Marseille I2M Marseille France
3 shared publications S. Ballet
3 shared publicationsStéphane Ballet
Aix Marseille Univ, CNRS, Centrale Marseille, I2M
3 shared publicationsDany-Jack Mercier
2 shared publications
Latest Publications
- Open Access
On the Weil descent of Artin-Schreier algebraic function fields over finite fields
Let us consider a generalized Artin-Schreier algebraic function field extension $F$ of the rational function field $\F_{p^n}(x)$ defined over the finite field extension $K=\F_{p^n}$ of the prime field $\F_p$. We assume that $K$ is algebraically closed in $F$. We give general results on the descent over the fields $k= \F_{p^t}$ for $t$ dividing $n$. Then, we completely handle the bi-cyclic case of the descent over the fields $k_1=\F_{p}$ and $k_2= \F_{p^2}$ of all the sub-extensions of $F$ defined over $\F_{p^4}$. We give explicit examples with small prime numbers $p$.Open AccessOn the Weil descent of Artin-Schreier algebraic function fields over finite fields
Let us consider a generalized Artin-Schreier algebraic function field extension $F$ of the rational function field $\F_{p^n}(x)$ defined over the finite field extension $K=\F_{p^n}$ of the prime field $\F_p$. We assume that $K$ is algebraically closed in $F$. We give general results on the descent over the fields $k= \F_{p^t}$ for $t$ dividing $n$. Then, we completely handle the bi-cyclic case of the descent over the fields $k_1=\F_{p}$ and $k_2= \F_{p^2}$ of all the sub-extensions of $F$ defined over $\F_{p^4}$. We give explicit examples with small prime numbers $p$. - Open Access
ON THE WEIL DESCENT OF ARTIN-SCHREIER ALGEBRAIC FUNCTION FIELDS OVER FINITE FIELDS
Let us consider a generalized Artin-Schreier algebraic function field extension F of the rational function field F p n (x) defined over the finite field extension K = F p n of the prime field Fp. We assume that K is algebraically closed in F . We give general results on the descent over the fields k = F p t for t dividing n. Then, we completely handle the bi-cyclic case of the descent over the fields k 1 = Fp and k 2 = F p 2 of all the sub-extensions of F defined over F p 4 . We give explicit examples with small prime numbers p.
Open AccessON THE WEIL DESCENT OF ARTIN-SCHREIER ALGEBRAIC FUNCTION FIELDS OVER FINITE FIELDS
Let us consider a generalized Artin-Schreier algebraic function field extension F of the rational function field F p n (x) defined over the finite field extension K = F p n of the prime field Fp. We assume that K is algebraically closed in F . We give general results on the descent over the fields k = F p t for t dividing n. Then, we completely handle the bi-cyclic case of the descent over the fields k 1 = Fp and k 2 = F p 2 of all the sub-extensions of F defined over F p 4 . We give explicit examples with small prime numbers p.
- 18 October 2022
- Published by Springer Nature
- p. 3-14
Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication
- 18 October 2022
- Published by Springer Nature
- p. 3-14
Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication
- Open Access
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative understanding of the domain. In particular, we identify and clarify certain results not completely proved and we emphasis the link with open problems in number theory, algebraic geometry, and coding theory.
Open AccessOn the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative understanding of the domain. In particular, we identify and clarify certain results not completely proved and we emphasis the link with open problems in number theory, algebraic geometry, and coding theory.
- 6 June 2020
- Published by Springer Nature
- p. 25-32
Blind Transfer of Personal Data Achieving Privacy
- Open Access
Optimization of Tree Modes for Parallel Hash Functions: A Case Study
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the corresponding tree topology so as to minimize the number of required processors as well. Consequently, the resulting scheme decreases in the first place the running time and in the second place the number of required processors.
Open AccessOptimization of Tree Modes for Parallel Hash Functions: A Case Study
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the corresponding tree topology so as to minimize the number of required processors as well. Consequently, the resulting scheme decreases in the first place the running time and in the second place the number of required processors.
- 12 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 66 (9) , 1585-1598
Optimization of Tree Modes for Parallel Hash Functions: A Case Study
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the corresponding tree topology so as to minimize the number of required processors as well. Consequently, the resulting scheme decreases in the first place the running time and in the second place the number of required processors.
- 12 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 66 (9) , 1585-1598
Optimization of Tree Modes for Parallel Hash Functions: A Case Study
This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function. We discuss the various forms of optimality that can be obtained when designing parallel hash functions based on trees where all leaves have the same depth. The first result is a scheme which optimizes the tree topology in order to decrease the running time. Then, without affecting the optimal running time we show that we can slightly change the corresponding tree topology so as to minimize the number of required processors as well. Consequently, the resulting scheme decreases in the first place the running time and in the second place the number of required processors.
- 29 March 2017
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 86 (308) , 2975-3000
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
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 finite fields. They are tailored to hardware implementation and they allow computations to be parallelized while maintaining a low number of bilinear multiplications. We give an example with the finite field F 16 13 \mathbb {F}_{16^{13}} .
- 29 March 2017
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 86 (308) , 2975-3000
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
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 finite fields. They are tailored to hardware implementation and they allow computations to be parallelized while maintaining a low number of bilinear multiplications. We give an example with the finite field F 16 13 \mathbb {F}_{16^{13}} .
- 24 December 2016
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 28 (5) , 387-408
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one
- 24 December 2016
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 28 (5) , 387-408
Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one
- Open Access
- 15 January 2016
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 354 (2) , 137-141
Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
Thanks to a new construction of the Chudnovsky and Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation and they allow computations to be parallelized, while maintaining a low number of bilinear multiplications. À partir d'une nouvelle construction de l'algorithme de multiplication de Chudnovsky et Chudnovsky, nous concevons des algorithmes efficaces pour la multiplication et l'exponentiation dans les corps finis. Ils sont adaptés à une implémentation matérielle et sont parallélisables, tout en gardant un nombre de multiplications bilinéaires très bas.
- 15 January 2016
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mathematique
- Vol. 354 (2) , 137-141
Open AccessEffective arithmetic in finite fields based on Chudnovsky's multiplication algorithm
Thanks to a new construction of the Chudnovsky and Chudnovsky multiplication algorithm, we design efficient algorithms for both the exponentiation and the multiplication in finite fields. They are tailored to hardware implementation and they allow computations to be parallelized, while maintaining a low number of bilinear multiplications. À partir d'une nouvelle construction de l'algorithme de multiplication de Chudnovsky et Chudnovsky, nous concevons des algorithmes efficaces pour la multiplication et l'exponentiation dans les corps finis. Ils sont adaptés à une implémentation matérielle et sont parallélisables, tout en gardant un nombre de multiplications bilinéaires très bas.