• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 16
  • 14
  • 4
  • 2
  • 1
  • 1
  • Tagged with
  • 44
  • 44
  • 17
  • 14
  • 12
  • 9
  • 9
  • 9
  • 8
  • 8
  • 8
  • 7
  • 7
  • 7
  • 6
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
21

Curvas algébricas sobre corpos finitos / Algebraic curves over finite fields

Steve da Silva Vicentim 27 April 2012 (has links)
A Teoria das curvas algébricas sobre corpos finitos é de fundamental importância para a matemática e tem aplicações essenciais em muitas áreas, tais como Geometria Finita, Teoria dos Números, Teoria de Grafos e Teoria de Códigos. Neste trabalho tratamos do segmento algébrico desta teoria, isto é, corpos de funções algébricas, inicialmente sobre qualquer corpo, apresentando propriedades fundamentais. Depois nos restringimos aos corpos de funções algébricas sobre corpos finitos, e são apresentados resultados referentes à estimativa do gênero e número de lugares racionais, além de propriedades que conectam estes dois números e a característica do corpo, sendo o principal resultado dado por: Para q uma potência de um número primo e N inteiro não negativo, existe uma constante inteira não negativa g0 (dependendo de q e N) tal que, para todo g maior ou igual a \'g IND. 0\', existe um corpo de funções sobre \'F IND. q\' de gênero g tendo exatamente N lugares racionais / The Theory of algebraic curves over finite fields is of fundamental importance to mathematics and has essential applications in many areas, such Finite Geometry, Number Theory, Graph Theory and Coding Theory. In this work we treat the algebraic part of this theory, ie, algebraic function fields, initially over any field, presenting fundamental properties. Then we restrict to algebraic function fields over finite fields, and presented results for the estimation of the genus and the number of racional places, as well as properties that connect these two numbers and the characteristic of the constant field, being the main result given by: For q a prime power and N a non-negative integer, there is an integer non-negative \'g IND. 0\' (that depends of q and N) such that for all \'g > or =\' \'g IND. 0\' , there exists a function field over \'F IND. q\' with genus g having exactly N racional places
22

Riemann Roch Theorem For Algebraic Curves

Rajeev, B 03 1900 (has links) (PDF)
No description available.
23

Descomposición Primaria y Campos Logarítmicos / Descomposición Primaria y Campos Logarítmicos

Fernández Sánchez, Percy 25 September 2017 (has links)
We describe the space of polynomial fields tangent to a given an algebraic curve. / Se da una descripción del espacio de campos polinomiales tangentes a una curva algebraica dada.
24

On the security of short McEliece keys from algebraic andalgebraic geometry codes with automorphisms / Étude de la sécurité de certaines clés compactes pour le schéma de McEliece utilisant des codes géométriques

Barelli, Elise 10 December 2018 (has links)
En 1978, McEliece introduit un schéma de chiffrement à clé publique issu de la théorie des codes correcteurs d’erreurs. L’idée du schéma de McEliece est d’utiliser un code correcteur dont lastructure est masquée, rendant le décodage de ce code difficile pour toute personne ne connaissant pas cette structure. Le principal défaut de ce schéma est la taille de la clé publique. Dans ce contexte, on se propose d'étudier l'utilisation de codes dont on connaît une représentation compacte, en particulier le cas de codes quais-cyclique ou quasi-dyadique. Les deux familles de codes qui nous intéressent dans cette thèse sont: la famille des codes alternants et celle des sous--codes sur un sous--corps de codes géométriques. En faisant agir un automorphisme $sigma$ sur le support et le multiplier des codes alternants, on saitqu'il est possible de construire des codes alternants quasi-cycliques. On se propose alors d'estimer la sécurité de tels codes à l'aide du textit{code invariant}. Ce sous--code du code public est constitué des mots du code strictement invariant par l'automorphisme $sigma$. On montre ici que la sécurité des codes alternants quasi-cyclique se réduit à la sécurité du code invariant. Cela est aussi valable pour les sous—codes sur un sous--corps de codes géométriques quasi-cycliques. Ce résultat nous permet de proposer une analyse de la sécurité de codes quasi-cycliques construit sur la courbe Hermitienne. En utilisant cette analyse nous proposons des clés compactes pour la schéma de McEliece utilisant des sous-codes sur un sous-corps de codes géométriques construits sur la courbe Hermitienne. Le cas des codes alternants quasi-dyadiques est aussi en partie étudié. En utilisant le code invariant, ainsi que le textit{produit de Schur}et le textit{conducteur} de deux codes, nous avons pu mettre en évidence une attaque sur le schéma de McEliece utilisant des codes alternants quasi-dyadique de degré $2$. Cette attaque s'applique notamment au schéma proposé dans la soumission DAGS, proposé dans le contexte de l'appel du NIST pour la cryptographie post-quantique. / In 1978, McEliece introduce a new public key encryption scheme coming from errors correcting codes theory. The idea is to use an error correcting code whose structure would be hidden, making it impossible to decode a message for anyone who do not know a specific decoding algorithm for the chosen code. The McEliece scheme has some advantages, encryption and decryption are very fast and it is a good candidate for public-key cryptography in the context of quantum computer. The main constraint is that the public key is too large compared to other actual public-key cryptosystems. In this context, we propose to study the using of some quasi-cyclic or quasi-dyadic codes. In this thesis, the two families of interest are: the family of alternant codes and the family of subfield subcode of algebraic geometry codes. We can construct quasi-cyclic alternant codes using an automorphism which acts on the support and the multiplier of the code. In order to estimate the securtiy of these QC codes we study the em{invariant code}. This invariant code is a smaller code derived from the public key. Actually the invariant code is exactly the subcode of code words fixed by the automorphism $sigma$. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on the invariant code. This is also true in the case of QC algebraic geometry codes. This result permits us to propose a security analysis of QC codes coming from the Hermitian curve. Moreover, we propose compact key for the McEliece scheme using subfield subcode of AG codes on the Hermitian curve. The case of quasi-dyadic alternant code is also studied. Using the invariant code, with the em{Schur product} and the em{conductor} of two codes, we show weaknesses on the scheme using QD alternant codes with extension degree 2. In the case of the submission DAGS, proposed in the context of NIST competition, an attack exploiting these weakness permits to recover the secret key in few minutes for some proposed parameters.
25

Teorema de Riemann-Roch e aplicações /

Arruda, Rafael Lucas de. January 2011 (has links)
Orientador: Parham Salehyan / Banca: Eduardo de Sequeira Esteves / Banca: Jéfferson Luiz Rocha Bastos / Resumo: O objetivo principal deste trabalho é estudar o Teorema de Riemann-Roch, um dos resultados fundamentais na teoria de curvas algébricas, e apresentar algumas de suas aplicações. Este teorema é uma importante ferramenta para a classificação das curvas algébricas, pois relaciona propriedades algébricas e topológicas. Daremos uma descrição das curvas algébricas de gênero g, 1≤ g ≤ 5, e faremos um breve estudo dos pontos de inflexão de um sistema linear sobre uma curva algébrica / Abstract: The main purpose of this work is to discuss The Riemann-Roch Theorem, wich is one of the most important results of the theory algebraic curves, and to present some applications. This theorem is an important tool of the classification of algebraic curves, sinces relates algebraic and topological properties. We will describle the algebraic curves of genus g, 1≤ g ≤ 5, and also study inflection points of a linear system on an algebraic curve / Mestre
26

Familles à un paramètre de surfaces en genre 2 / One parameter families of surfaces in genus 2

Rodriguez, Olivier 08 December 2010 (has links)
Cette thèse porte sur certaines familles à un paramètre de surfaces de Riemann compactes de genre 2 définies par des surfaces de translation. Les familles que nous considérons constituent des géodésiques de Teichmüller dans l'espace des modules.Nous nous attachons en particulier à décrire ces surfaces par leurs matrices des périodes et par les équations des courbes algébriques associées.Nous étudions notamment les automorphismes admissibles par les surfaces de certaines de ces familles.Le principal résultat consiste en une caractérisation explicite des matrices des périodes des courbes réelles à trois composantes réelles appartenant à la famille obtenue par projection dans l'espace des modules de la SL(2,R)-orbite de la surface de translation en «L» pavée par trois carreaux.Nous montrons enfin, grâce à une interprétation en termes de transformations de Schwarz-Christoffel, comment calculer numériquement une équation de la courbe algébrique définie par une surface de translation en «L». / In this thesis we study some one parameter families of compact Riemann surfaces of genus 2 defined by translation surfaces.The families we consider are Teichmüller geodesics in the moduli space.We mainly describe these surfaces by means of period matrices and equations of the associated algebraic curves.We study admissible automorphisms for surfaces in some of those families.The main result is an explicit characterisation of period matrices of real curves with three real components belonging to the family obtained by projecting the SL(2,R)-orbit of the «L»-shaped translation surface tiled by three squares into the moduli space.We finally show, using an interpretation in terms of Schwarz-Christoffel transformations, how to numerically compute an equation of the algebraic curve defined by a «L»-shaped translation surface.
27

Parametrização e otimização de criptografia de curvas elípticas amigáveis a emparelhamentos. / Parameterization and optmization of pairing-friendly elliptic curves.

Pereira, Geovandro Carlos Crepaldi Firmino 27 April 2011 (has links)
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.
28

Fibres vectoriels sur des courbes hyperelliptiques / Vector bundles on hyperelliptic curves

Fernández Vargas, Néstor 04 April 2018 (has links)
Cette thèse est dédiée à l'étude des espaces de modules de fibrés sur une courbe algébrique et lisse sur le corps des nombres complexes.  Le texte est composé de deux parties : Dans la première partie, je m'intéresse à la géométrie liée aux classifications de fibrés quasi-paraboliques de rang 2 sur une courbe elliptique 2-pointée, à isomorphisme près. Les notions d'indécomposabilité, simplicité et stabilité de fibrés donnent lieu à des espaces de modules qui classifient ces objets.  La structure projective de ces espaces est décrite explicitement, et on prouve un théorème de type Torelli qui permet de retrouver la courbe elliptique 2-pointée.  Cet espace de modules est aussi mis en relation avec l'espace de modules de fibrés quasi-paraboliques sur une courbe rationnelle 5-pointée, qui apparaît naturellement comme revêtement double de l'espace de modules de fibrés quasi-paraboliques sur la courbe elliptique 2-pointée. Finalement, on démontre explicitement la modularité des automorphismes de cet espace de modules. Dans la deuxième partie, j'étudie l'espace de modules de fibrés semistables de rang 2 et déterminant trivial sur une courbe hyperelliptique. Plus précisément, je m'intéresse à l'application naturelle donnée par le fibré déterminant, générateur du groupe de Picard de cet espace de modules. Cette application  s'identifie à l'application theta, qui est de degré 2 dans notre cas. On définit une fibration de cet espace de modules vers un espace projective dont la fibre générique est birationnelle à l'espace de modules de courbes rationnelles 2g-épointées, et on décrit la restriction de theta aux fibres de cette fibration. On montre que cette restriction est, à une transformation birationnelle près, une projection osculatoire centrée en un point. En utilisant une description due à Kumar, on démontre que la restriction de l'application theta à cette fibration ramifie sur la variété de Kummer d'une certaine courbe hyperelliptique de genre g – 1. / This thesis is devoted to the study of moduli spaces of vector bundles over a smooth algebraic curve over field of complex numbers. The text consist of two main parts : In the first part, I investigate the geometry related to the classifications of rank 2 quasi-parabolic vector bundles over a 2-pointed elliptic curves, modulo isomorphism. The notions of indecomposability, simplicity and stability give rise to the corresponding moduli spaces classifying these objects. The projective structure of these spaces is explicitely described, and we prove a Torelli theorem that allow us to recover the 2-pointed elliptic curve. I also explore the relation with the moduli space of quasi-parabolic vector bundles over a 5-pointed rational curve, appearing naturally as a double cover of the moduli space of quasi-parabolic vector bundles over the 2-pointed elliptic curve. Finally, we show explicitely the modularity of the automorphisms of this moduli space. In the second part, I study the moduli space of semistable rank 2 vector bundles with trivial determinant over a hyperelliptic curve C. More precisely, I am interested in the natural map induced by the determinant line bundle, generator of the Picard group of this moduli space. This map is identified with the theta map, which is of degree 2 in our case. We define a fibration from this moduli space to a projective space whose generic fiber is birational to the moduli space of 2g-pointed rational curves, and we describe the restriction of the map theta to the fibers of this fibration. We show that this restriction is, up to a birational map, an osculating projection centered on a point. By using a description due to Kumar, we show that the restriction of the map theta to this fibration ramifies over the Kummer variety of a certain hyperelliptic curve of genus g - 1.
29

Parametrização e otimização de criptografia de curvas elípticas amigáveis a emparelhamentos. / Parameterization and optmization of pairing-friendly elliptic curves.

Geovandro Carlos Crepaldi Firmino Pereira 27 April 2011 (has links)
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.
30

Sobre o numero de pontos racionais de curvas sobre corpos finitos / On the number of rational points of curves over finite fields

Castilho, Tiago Nunes, 1983- 19 March 2008 (has links)
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

Page generated in 0.0359 seconds