Efficient implementation of the number theoretic transform(NTT), also known as the discrete Fourier transform(DFT) over a finite field, has been studied actively for decades and found many applications in digital signal processing. In 1971 Schonhage and Strassen proposed an NTT based asymptotically fast multiplication method with the asymptotic complexity O(m log m log log m) for multiplication of $m$-bit integers or (m-1)st degree polynomials. Schonhage and Strassen's algorithm was known to be the asymptotically fastest multiplication algorithm until Furer improved upon it in 2007. However, unfortunately, both algorithms bear significant overhead due to the conversions between the time and frequency domains which makes them impractical for small operands, e.g. less than 1000 bits in length as used in many applications. With this work we investigate for the first time the practical application of the NTT, which found applications in digital signal processing, to finite field multiplication with an emphasis on elliptic curve cryptography(ECC). We present efficient parameters for practical application of NTT based finite field multiplication to ECC which requires key and operand sizes as short as 160 bits in length. With this work, for the first time, the use of NTT based finite field arithmetic is proposed for ECC and shown to be efficient. We introduce an efficient algorithm, named DFT modular multiplication, for computing Montgomery products of polynomials in the frequency domain which facilitates efficient multiplication in GF(p^m). Our algorithm performs the entire modular multiplication, including modular reduction, in the frequency domain, and thus eliminates costly back and forth conversions between the frequency and time domains. We show that, especially in computationally constrained platforms, multiplication of finite field elements may be achieved more efficiently in the frequency domain than in the time domain for operand sizes relevant to ECC. This work presents the first hardware implementation of a frequency domain multiplier suitable for ECC and the first hardware implementation of ECC in the frequency domain. We introduce a novel area/time efficient ECC processor architecture which performs all finite field arithmetic operations in the frequency domain utilizing DFT modular multiplication over a class of Optimal Extension Fields(OEF). The proposed architecture achieves extension field modular multiplication in the frequency domain with only a linear number of base field GF(p) multiplications in addition to a quadratic number of simpler operations such as addition and bitwise rotation. With its low area and high speed, the proposed architecture is well suited for ECC in small device environments such as smart cards and wireless sensor networks nodes. Finally, we propose an adaptation of the Itoh-Tsujii algorithm to the frequency domain which can achieve efficient inversion in a class of OEFs relevant to ECC. This is the first time a frequency domain finite field inversion algorithm is proposed for ECC and we believe our algorithm will be well suited for efficient constrained hardware implementations of ECC in affine coordinates.

A tendência para o futuro da tecnologia é a produção de dispositivos eletrônicos e de computação cada vez menores. Em curto e médio prazos, ainda há poucos recursos de memória e processamento neste ambiente. A longo prazo, conforme a Física, a Química e a Microeletrônica se desenvolvem, constata-se significativo aumento na capacidade de tais dispositivos. No intervalo de curto e médio prazos, entre 20 e 50 anos, até que a tecnologia tenha avanços, soluções leves de software se vêem necessárias. No Brasil, o protocolo de assinatura digital RSA é o mais amplamente adotado, sendo obsolescente como padrão. O problema é que os avanços tecnológicos impõem um aumento considerável no tamanho das chaves criptográficas para que se mantenha um nível de segurança adequado, resultando efeitos indesejáveis em tempo de processamento, largura de banda e armazenamento. Como solução imediata, temos a criptografia de curvas elípticas sendo mais adequada para utilização por órgãos públicos e empresas. Dentro do estudo de curvas elípticas, este trabalho contribui especificamente com a introdução de uma nova subfamília das curvas amigáveis a emparelhamento Barreto-Naehrig (BN). A subfamília proposta tem uma descrição computacionalmente simples, tornando-a capaz de oferecer oportunidades de implementação eficiente. A escolha das curvas BN também se baseia no fato de possibilitarem uma larga faixa de níveis práticos de segurança. A partir da subfamília introduzida foram feitas algumas implementações práticas começando com algoritmos mais básicos de operações em corpos de extensão, passando por algoritmos de aritmética elíptica e concluindo com o cálculo da função de emparelhamento. A combinação da nova subfamília BN com a adoção de técnicas de otimização, cuidadosamente escolhidas, permitiu a mais eficiente implementação do emparelhamento Ate ótimo, operação bastante útil em aplicações criptográficas práticas. / The trend for the future consists of steadfast shrinking of electrical and computing devices. In the short to medium term, one will still find constrained storage and processing resources in that environment. In the long run, as Physics, Chemistry and Microelectronics progress, the capabilities of such devices are likely to increase. In 20 to 50 years from now, until technology has firm advances, lightweight software solutions will be needed. In Brazil, the most widely adopted signature protocol, the RSA scheme, is obsolescent as a standard. The problem is that technological advances impose a considerable increase in cryptographic key sizes in order to maintain a suitable security level, bringing about undesirable effects in processing time, bandwidth occupation and storage requirements. As an immediate solution, we have the Elliptic Curve Cryptography which is more suitable for utilization in public agencies and industry. In the field of elliptic curves, this work contributes specifically with the introduction of a new subfamily of the pairing-friendly Barreto-Naehrig (BN) curves. The proposed subfamily has a computationally simple description, and makes it able to offer opportunities for efficient implementation. The choice of the BN curves is also based on the fact that they allow a range of practical security levels. Furthermore, there were made practical implementations from the introduced subfamily, like the most basic extension fields algorithms, elliptic curve arithmetic and pairing computation. The adoption of the new BN subfamily with carefully chosen optimization techniques allowed the most efficient implementation of the optimal Ate pairing, which is a very useful operation in many practical cryptographic applications.

In this thesis we study discrete dynamical system, given by a polynomial, over both finite extension of the fields of p-adic numbers and over finite fields. Especially in the p-adic case, we study fixed points of dynamical systems, and which elements that are attracted to them. We show with different examples how complex these dynamics are. For certain polynomial dynamical systems over finite fields we prove that the normalized average of the numbers of linear factors modulo prime numbers exists. We also show how to calculate the average, by using Chebotarev's Density Theorem. The non-normalized version of the average of the number of linear factors of linearized polynomials modulo prime numbers, tends to infinity, so in that case we find an asymptotic formula instead. We have also used a computer to study different behaviors, such as iterations of polynomials over the p-adic fields and the asymptotic relation mention above. In the last chapter we present the computer programs used in different part of the thesis.

In our study Fq denotes the finite field with q elements. It is interesting to construct curves of given genus over Fq with many Fq -rational points. Drinfeld modular curves can be used to construct that kind of curves over Fq . In this study we will use reductions of the Drinfeld modular curves X_{0} (n) to obtain curves over finite fields with many rational points. The main idea is to divide the Drinfeld modular curves by an Atkin-Lehner involution which has many fixed points to obtain a quotient with a better #{rational points} /genus ratio. If we divide the Drinfeld modular curve X_{0} (n) by an involution W, then the number of rational points of the quotient curve WX_{0} (n) is not less than half of the original number. On the other hand, if this involution has many fixed points, then by the Hurwitz-Genus formula the genus of the curve WX_{0} (n) is much less than half of the g (X_{0}(n)).

Η εργασία αφορά ένα ειδικό είδος κωδικοποίησης εντοπισμού και διόρθωσης λαθών, την κωδικοποίση Reed-Solomon. Οι κώδικες αυτού του είδους χρησιμοποιούνται σε τηλεπικοινωνιακές εφαρμογές (ενσύρματη τηλεφωνία, ψηφιακή τηλεόραση, ευρυζωνικές ασύρματες επικοινωνίες) και σε συστήματα ψηφιακής αποθήκευσης (οπτικοί, μαγνητικοί δίσκοι). Η κωδικοποίηση Reed-Solomon βασίζεται σε μία ειδική κατηγορία αριθμητικών πεδίων τα πεδία Galois (Galois Field). Στα πλαίσια της εργασίας πραγματοποιήθηκε μελέτη των ιδιοτήτων των πεδίων Galois. και σχεδιάστηκε κωδικοποιητής-αποκωδικοποιητής για κώδικες Reed Solomon. Η σχεδίαση υλοποιήθηκε σε υλικό (hardware) σε γλώσσα Verilog HDL. Η σύνθεση των κυκλωμάτων πραγματοποιήθηκε με τεχνολογία Πεδίων Προγραμματιζόμενων Πινάκων Πυλών (τεχνολογία FPGA) και τεχνολογία Ολοκληρωμένων Κυκλωμάτων Ειδικού Σκοπού (τεχνολογία ASIC). Ακολουθήθηκε η μεθοδολογία σχεδιασμού Μονάδων Διανοητικής Ιδιοκτησίας για ολοκληρωμένα κυκλώματα (IP core), σύμφωνα με την οποία η σχεδίαση είναι ανεξάρτητη της πλατφόμας υλοποίησης και μπορεί να υλοποιηθεί με καθόλου ή ελάχιστες αλλαγές σε διαφορετικές τεχνολογίες. Η έννοια των IP core βρίσκει ιδιαίτερη εφαρμογή σε Συστήματα σε Ολοκληρωμένα Κυκλώματα (System on Chip). / The present work is about a specific group of error detection and correction codes, the Reed-Solomon codes. Such codes are used in telecommunications applications (wire telephony, digital television, broadband wireless communications) and digital storage systems (optical, magnetic disks). The Reed Solomon codes are based on a specific category of numerical fields, called Galois Fields. The Work consists of the study of the properties of Galois fields and of the design of an codec for Reed Solomon codes. The design was implemented in hardware with the use of Verilog HDL language. The synthesis of the circuit targets Field programmable Gate Array (FPGA) and Applications Specific Integrated Circuit (ASIC) technologies. The design methodology for Intellectual Property Units for integrated circuits (IP cores) was used. According to that methodology the design is platform independent and consequently the implementation can be achieved with minimal or no changes in different technologies. The IP cores model is widely applied in Systems on Integrated Circuits (System on Chips).

In this thesis, the work of Menezes on the isomorphism classes of elliptic curves over finite fields of characteristic two is studied. Basic definitions and some facts of the elliptic curves required in this context are reviewed and group structure of elliptic curves are constructed. A fairly detailed investigation is made for the isomorphism classes of elliptic curves due to Menezes and Schoof. This work plays an important role in Elliptic Curve Digital Signature Algorithm. In this context, those isomorphism classes of elliptic curves recommended by National Institute of Standards and Technology are listed and their properties are discussed.

In this paper, we provide a complete survey of the important criteria for permutation polynomials over finite fields, including the classical Hermite-Dickson's Criterion and the recent Wan-Turnwald's Criterion. We review the various proofs of these criteria and give new proofs of them.

Orientador: Fernando Eduardo Torres Orihuela / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-10T15:12:25Z (GMT). No. of bitstreams: 1 Castilho_TiagoNunes_M.pdf: 813127 bytes, checksum: 313e9951b003dcd0e0876813659d7050 (MD5) Previous issue date: 2008 / Resumo: Nesta dissertacao estudamos cotas para o numero de pontos racionais de curvas definidas sobre corpos finitos tendo como ponto de partida a teoria de Stohr-Voloch / Abstract: In this work we study upper bounds on the number of rational points of curves over finite fields by using the Stohr-Voloch theory / Mestrado / Algebra Comutativa, Geometria Algebrica / Mestre em Matemática

Seja p um primo, considere q = pe com e ≥ 1 inteiro. Dado o polinômio f (x) = x4+ax3+bx2+ cx+d ∈ Fq[x], consideremos o polinômio F(T) = T4 +aT3 +bT2 +cT + d - y ∈ Fq(y)[T], com y = f (x) sobre Fq(y). O objetivo desse trabalho é determinar o número de polinômios f (x) que tem seu grupo de galois associado GF isomorfo a cada subgrupo transitivo (prefixado) de S4. O trabalho foi baseado no artigo: Galois closures of quartic sub-fields of rational function fields, usando equações auxiliares associadas ao polinômio minimal F(T) de graus 3 e 2 (DUMMIT, 1994); bem como uma caraterização das curvas projetivas planas de grau 2 não singulares. Se car(k) ≠ 2, associamos a F(T) sua cúbica resolvente RF(T) e seu discriminante ΔF. Em seguida obtemos condições para GF ≅ C4 (vide Teorema 2.9), que é ocaso fundamental para determinação dos demais casos. Se car(k) = 2, procuramos determinar condições para GRF ≅ A3, associando ao polinômio RF(T) sua quadrática resolvente P(T) (vide a Proposição 2.13). Apos ter homogeneizado P(T), usamos uma das consequências do teorema de Bézout, a saber, uma curva algébrica projetiva plana C de grau 2 é irredutível se, e somente se, C não tem pontos singulares. Nesta dissertação obtemos resultados semelhantes com uma abordagem relativamente diferente daquela usada pelo autor R. Valentini. / Let be p a prime, q = pe whit e ≥ 1 integer. Let a polynomial f (x) = x4+ax3+bx2+cx+d ∈ Fq[x], considering the polynomial F(T)=T4+aT3+bT2+cT +d, with y= f (x) over Fq(y)[T]. The purpose of the current research is to determine the numbers of polynomials f (x) which have its associated Galois group GF, this GF is isomorphic for each transitive subgroup (prefixed) of A4. This project is based on the article: Galois closures of quartic sub-fields of rational function fields, using auxiliary equations associated to the minimal polynomial F(T) of degrees 3 and 2 (DUMMIT, 1994); besides a characterization of non-singular projective plane curves of degree 2 was used. If car(k) ≠ 2, associated to F(T) the resolvent cubic RF(T) and its discriminant ΔF then conditions for GF are obtained as GF ≅ C4 which is the fundamental case for determining the other cases (Theorem 2.9). If car(k) = 2, to find conditions for GRF ≅ A3, associated to the polynomial RF(T) its resolvent quadratic p(T) (Proposition 2.13). Homogenizing p(T), one of the consequences of the Bezout theorem was applied. It is, a projective plane curve C, which grade 2, is irreducible if and only if C is smooth. In the current dissertation, similar results were obtained using a different approach developed by the author R. Valentini.

Le polynôme caractéristique d'une variété abélienne sur un corps fini est défini comme étant celui de son endomorphisme de Frobenius. La première partie de cette thèse est consacrée à l'étude des polynômes caractéristiques de variétés abéliennes de petite dimension. Nous décrivons l'ensemble des polynômes intervenant en dimension 3 et 4, le problème analogue pour les courbes elliptiques et surfaces abéliennes ayant été résolu par Deuring, Waterhouse et Rück.Dans la deuxième partie, nous établissons des bornes supérieures et inférieures sur le nombre de points rationnels des variétés abéliennes sur les corps finis. Nous donnons ensuite des bornes inférieures spécifiques aux variétés jacobiennes. Nous déterminons aussi des formules exactes pour les nombres maximum et minimum de points rationnels sur les surfaces jacobiennes. / The characteristic polynomial of an abelian variety over a finite field is defined to be the characteristic polynomial of its Frobenius endomorphism. The first part of this thesis is devoted to the study of the characteristic polynomials of abelian varieties of small dimension. We describe the set of polynomials which occur in dimension 3 and 4; the analogous problem for elliptic curves and abelian surfaces has been solved by Deuring, Waterhouse and Rück.In the second part, we give upper and lower bounds on the number of points on abelian varieties over finite fields. Next, we give lower bounds specific to Jacobian varieties. We also determine exact formulas for the maximum and minimum number of points on Jacobian surfaces.