#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1973

2017

- This year (1)
- Last 5 years (11)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert Rolland
- Cryptography and Communications
- 2009

The second weight of the Generalized Reed-Muller code of length q n and order d over the finite field with q elements is now known for d < q and d > (n − 1)(q − 1). In this paper, we determine the second weight for the other values of d which are not multiples of q − 1 plus 1. For the special case d = a(q − 1) + 1 we give an estimate.

- Stéphane Ballet, Robert Rolland
- Des. Codes Cryptography
- 2014

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight codewords are products of affine functions. Then in the general case we study some types of codewords and prove that they… (More)

— Let us consider an algebraic function field defined over a finite Galois extension K of a perfect field k. We recall some elementary conditions allowing the descent of the definition field of the algebraic function field from K to k. We apply these results to the descent of the definition field of a tower of function fields. We give explicitly the… (More)

- Robert Rolland
- 2005

— The aim of this paper is to introduce the bilinear complexity of the multiplication in finite fields and to give a brief exposition of the recent results obtained in this part of algebraic complexity theory. In particular we present the new results obtained using the Chudnovsky-Chudnovsky algorithm and its generalizations. Résumé (Sur la complexité… (More)

- Stéphane Ballet, Robert Rolland
- ArXiv
- 2012

A brief survey on low weight codewords of generalized Reed-Muller codes and projective generalized Reed-Muller codes is presented. In the affine case some information about the words that reach the second distance is given. Moreover the second weight of the projective Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are… (More)

- Robert Rolland
- Applicable Algebra in Engineering, Communication…
- 1992

A code of lengthn, dimensionk and minimum distanced ismaximum distance separable (MDS) ifk+d=n+1. We give the number of MDS codes of length 7 and dimension 3 on finite fields withq elements whereq=2 m . In order to get this number, we compute the number of configurations of seven points in the projective plane overF q , no three of which are collinear.

- Kevin Atighehchi, Robert Rolland
- ArXiv
- 2015

This paper focuses on parallel hash functions based on tree modes of operation for a compression function. We discuss the various forms of opti-mality that can be obtained when designing such parallel hash functions. The first result is a scheme which optimizes the tree topology in order to decrease at best the running time. Then, without affecting the… (More)

We study the geometrical properties of the subgroups of the mutliplicative group of a "nite extension of a "nite "eld endowed with its vector space structure and we show that in some cases the associated projective space has a natural group structure. We construct some cyclic codes related to Reed}Muller codes by evaluating polynomials on these subgroups.… (More)

- Kevin Atighehchi, Traian Muntean, Sylvain Parlanti, Robert Rolland, Laurent Vallet
- 2010 12th International Symposium on Symbolic and…
- 2010

This paper describes a new key forwarding protocol for networks messages exchange which guaranties both authentication of participants and forward security. The protocol lies within the framework of a keys derivation scheme used for spanning tree-based networks messages diffusion where compromising a key in a node involves compromising all derived keys in… (More)

- Dimitrios Poulakis, Robert Rolland
- IACR Cryptology ePrint Archive
- 2012

In this paper we propose a signature scheme based on two intractable problems , namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides smaller signatures than the existing schemes based on the integer factor-ization and integer discrete… (More)