Polynomial Automorphisms Over Finite Fields

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

Properties of sparse random matrices over finite fields

Typical properties of sparse random matrices over finite (Galois) fields are studied, in the limit of large matrices, using techniques from the physics of disordered systems. For the case of a finite field GF(q) with prime order q, we present results for the average kernel dimension, average dimension of the eigenvector spaces and the distribution of the eigenvalues. The number of matrices for a given distribution of entries is also calculated for the general case. The significance of these results to error-correcting codes and random graphs is also discussed.

Polynomial automorphisms over finite fields: Mimicking tame maps by the Derksen group

2010 Mathematics Subject Classification: 14L99, 14R10, 20B27.

Kumar's algorithm for solving Toeplitz systems of equations over finite fields

Adaptació de l'algorisme de Kumar per resoldre sistemes d'equacions amb matrius de Toeplitz sobre els reals a cossos finits en un temps 0 (n log n).

Volcanoes of l-isogenies of elliptic curves over finite fields: the case l=3

This paper is devoted to the study of the volcanoes of l-isogenies of elliptic curves over a finite field, focusing on their height as well as on the location of curves across its different levels. The core of the paper lies on the relationship between the l-Sylow subgroup of an elliptic curve and the level of the volcano where it is placed. The particular case l = 3 is studied in detail, giving an algorithm to determine the volcano of 3-isogenies of a given elliptic curve. Experimental results are also provided.

On Space-Time Trade-Off for Montgomery Multipliers over Finite Fields

La multiplication dans le corps de Galois à 2^m éléments (i.e. GF(2^m)) est une opérations très importante pour les applications de la théorie des correcteurs et de la cryptographie. Dans ce mémoire, nous nous intéressons aux réalisations parallèles de multiplicateurs dans GF(2^m) lorsque ce dernier est généré par des trinômes irréductibles. Notre point de départ est le multiplicateur de Montgomery qui calcule A(x)B(x)x^(-u) efficacement, étant donné A(x), B(x) in GF(2^m) pour u choisi judicieusement. Nous étudions ensuite l'algorithme diviser pour régner PCHS qui permet de partitionner les multiplicandes d'un produit dans GF(2^m) lorsque m est impair. Nous l'appliquons pour la partitionnement de A(x) et de B(x) dans la multiplication de Montgomery A(x)B(x)x^(-u) pour GF(2^m) même si m est pair. Basé sur cette nouvelle approche, nous construisons un multiplicateur dans GF(2^m) généré par des trinôme irréductibles. Une nouvelle astuce de réutilisation des résultats intermédiaires nous permet d'éliminer plusieurs portes XOR redondantes. Les complexités de temps (i.e. le délais) et d'espace (i.e. le nombre de portes logiques) du nouveau multiplicateur sont ensuite analysées: 1. Le nouveau multiplicateur demande environ 25% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito lorsque GF(2^m) est généré par des trinômes irréductible et m est suffisamment grand. Le nombre de portes du nouveau multiplicateur est presque identique à celui du multiplicateur de Karatsuba proposé par Elia. 2. Le délai de calcul du nouveau multiplicateur excède celui des meilleurs multiplicateurs d'au plus deux évaluations de portes XOR. 3. Nous determinons le délai et le nombre de portes logiques du nouveau multiplicateur sur les deux corps de Galois recommandés par le National Institute of Standards and Technology (NIST). Nous montrons que notre multiplicateurs contient 15% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito au coût d'un délai d'au plus une porte XOR supplémentaire. De plus, notre multiplicateur a un délai d'une porte XOR moindre que celui du multiplicateur d'Elia au coût d'une augmentation de moins de 1% du nombre total de portes logiques.

Some classes of semisimple group (and loop) algebras over finite fields

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components We apply our work to obtain similar information about the loop algebras of mdecomposable RA loops and to produce negative answers to the isomorphism problem over various fields (C) 2010 Elsevier Inc All rights reserved

The Divisibility Modulo 4 of Kloosterman Sums over Finite Fields of Characteristic 3

Recently Garashuk and Lisonek evaluated Kloosterman sums K (a) modulo 4 over a finite field F3m in the case of even K (a). They posed it as an open problem to characterize elements a in F3m for which K (a) ≡ 1 (mod4) and K (a) ≡ 3 (mod4). In this paper, we will give an answer to this problem. The result allows us to count the number of elements a in F3m belonging to each of these two classes.

An improved sum-product estimate for general finite fields

An improved sum-product estimate for subsets of a finite field whose order is not prime is provided. It is shown, under certain conditions, that max{∣∣∣A+A∣∣∣,∣∣∣A⋅A∣∣∣}≫∣∣A∣∣12/11(log2∣∣A∣∣)5/11. This new estimate matches, up to a logarithmic factor, the current best known bound obtained over prime fields by Rudnev

Statistical mechanics of low-density parity check error-correcting codes over Galois fields

A variation of low-density parity check (LDPC) error-correcting codes defined over Galois fields (GF(q)) is investigated using statistical physics. A code of this type is characterised by a sparse random parity check matrix composed of C non-zero elements per column. We examine the dependence of the code performance on the value of q, for finite and infinite C values, both in terms of the thermodynamical transition point and the practical decoding phase characterised by the existence of a unique (ferromagnetic) solution. We find different q-dependence in the cases of C = 2 and C ≥ 3; the analytical solutions are in agreement with simulation results, providing a quantitative measure to the improvement in performance obtained using non-binary alphabets.

Aspects of Iwasawa theory over function fields

"Vegeu el resum a l'inici del document del fitxer adjunt."

Parameter spaces of environmental fields responsible for cyclone development from tropics to extratropics

Objective cyclone tracking applied to a 30-yr reanalysis dataset shows that cyclone development in the summer and autumn seasons is active in the tropics and extratropics and inactive in the subtropics. To understand this geographically bimodal distribution of cyclone development associated with tropical and extratropical cyclones quantitatively, the direct relationship between cyclone types and their environments are assessed by using a parameter space of environmental variables [environmental parameter space (EPS)]. The number of cyclones is analyzed in terms of two different factors: the environmental conditions favorable for cyclone development and the area size that satisfies the favorable condition. The EPS analysis is mainly conducted for two representative environmental parameters that are commonly used for cyclone analysis: potential intensity for tropical cyclones and baroclinicity for extratropical cyclones. The geographically bimodal distribution is attributed to the high sensitivity of the cyclone development to the change in the environmental fields from tropics to extratropics. In addition, the bimodal distribution is partly attributed to the rapid change in the environmental fields from tropics to extratropics. The EPS analysis also shows that other environmental parameters, including relative humidity and vertical velocity, may enhance the contrast between the tropics (extratropics) and subtropics, whereas they are not essential for determining cyclone types. The relationship between cyclones and their environments is found to be similar between the hemispheres in the EPS, although the geographical distribution, particularly the longitudinal uniformity, is markedly different between the hemispheres.

Indecomposable and noncrossed product division algebras over function fields of smooth p-adic curves

We construct indecomposable and noncrossed product division algebras over function fields of connected smooth curves X over Z(p). This is done by defining an index preserving morphism s: Br(<(K(X))over cap>)` --> Br(K(X))` which splits res : Br(K (X)) --> Br(<(K(X))over cap>), where <(K(X))over cap> is the completion of K (X) at the special fiber, and using it to lift indecomposable and noncrossed product division algebras over <(K(X))over cap>. (C) 2010 Elsevier Inc. All rights reserved.