Current needs of human communication came to status, when most of transferred messages are considered as private and transition over non-secured communication lines in open form is not possible. That originated a lot of different methods for securing of messages and transfers in ciphered form. Two mainstreams were established, symmetric cryptography and asymmetric cryptography. Second of mentioned groups is based on usage of two information – keys, when one of then is broadly known and is public and second, well protected and private. Using a public key it is possible to establish a cryptogram of message, but for deciphering it is necessary to know private key. Asymmetric methods are based on mathematical problems, for which there is not an effective computing algorithm. This thesis are focused for asymmetric cryptosystems based on discrete logarithm problem, where ciphering of message using public key is very easy and quick, but deciphering without knowledge of private key is extremely time consuming process. Work describes a mathematical base of discrete logarithm problem, its’ properties and methods developed for solving of this problem. Descriptions of particular cryptosystems are given, i.e. ElGamal cryptosystem, Diffie-Hellman protocol and DSA. Second part of thesis is focused for web application developed as study support of discrete logarithm problem and of cryptosystems using this problem. It describes functional and graphical interface, work with it and options given to user working with application. Mentions also lessons for user which should help with understanding of described problems and practicing.

Seit W. Diffie und M. Hellman im Jahr 1976 ihren Ansatz für einen sicheren kryptographischen Schlüsselaustausch vorgestellten, ist der sogenannte Diskrete Logarithmus zu einem zentrales Thema der Kryptoanalyse geworden. Dieser stellt eine Erweiterung des bekannten Logarithmus auf beliebige endliche Gruppen dar. In der vorliegenden Dissertation werden zwei von C. Diem eingeführte Algorithmen untersucht, mit deren Hilfe der diskrete Logarithmus in der Picardgruppe glatter, nichthyperelliptischer Kurven vom Geschlecht g > 3 bzw. g > 4 über endlichen Körpern berechnet werden kann. Beide Ansätze basieren auf der sogenannten Indexkalkül-Methode und benutzen zur Erzeugung der dafür benötigten Relationen spezielle Linearsysteme, welche durch Schneiden von ebenen Modellen der Kurve mit Geraden erzeugt werden. Um Aussagen zur Laufzeit der Algorithmen tätigen zu können, werden verschiedene Sätze über die Geometrie von Kurven bewiesen. Als zentrale Aussage wird zum einem gezeigt, dass ebene Modelle niedrigen Grades effizient berechnet werden können. Zum anderen wird bewiesen, dass sich bei genügend großem Grundkörper die Anzahl der vollständig über dem Grundkörper zerfallenden Geraden wie heuristisch erwartet verhällt. Für beide Aussagen werden dabei Familien von Kurven betrachtet und diese gelten daher uniform für alle glatten, nichthyperelliptischen Kurven eines festen Geschlechts. Die genannten Resultate führen schlussendlich zu dem Beweis einer erwarteten Laufzeit von O(q^(2-2/(g-1))) für den ersten der beiden Algorithmen, wobei q die Anzahl der Elemente im Grundkörper darstellt. Der zweite Algoritmus verbessert dies auf eine heuristische Laufzeit in O(q^(2-2/(g-2))), imdem er Divisoren von höherem Spezialiätsgrad erzeugt. Es wird bewiesen, dass dieser Ansatz für einen uniform gegen 1 konvergierenden Anteil an glatten, nichthyperelliptischen Kurven eines festen Geschlechts über Grundkörpern großer Charakteristik eine große Anzahl an Relationen erzeugt. Wiederum werden zum Beweis der zugrundeliegenden geometrischen Aussagen Familien von Kurven betrachtet, um so die Uniformität zu gewährleisten. Beide Algorithmen wurden zudem implementiert. Zum Abschluss der Arbeit werden die Ergebnisse der entsprechenden Experimente vorgestellt und eingeordnet.

Der Vortrag erläutert das Grundprinzip des Diffie-Hellman-Schlüsseltausches mithilfe des diskreten Logarithmus unter Zuhilfenahme elliptischer Kurven über endlichen Körpern.

No description available.

<p>This thesis is funded by the IBM Center for Advanced Studies</p> / <p>A large number of scientific applications rely on the computing of logarithm. Thus, accelerating the speed of computing logarithms is significant and necessary. To this end, we present the realization of a pipelined Logarithm Computation Unit (LCU) in hardware that uses lookup table and interpolation techniques. The presented LCU supports single precision arithmetic with fixed accuracy and speed. We estimate that it can generate 2.9G single precision values per second under a 65nm fabrication process. In addition, the accuracy is at least 21 bits while lookup table size is about 7.776KB. To the best of our knowledge, our LCU achieves the fastest speed at its current accuracy and table size.</p> / Master of Science (MSc)

Given an elliptic curve E over Fp and an integer e ≥ 1, we define a new object, called “elliptic loop”, as the set of plane projective points over Z/p^e Z lying over E, endowed with an operation inherited by the curve addition. This object is proved to be a power-associative abelian algebraic loop. Its substructures are investigated by means of other algebraic cubics defined over the same ring, which we named “shadow curve” and “layers”. When E has trace 1, a distinctive behavior is detected and employed for producing an isomorphism attack to the discrete logarithm on this family of curves. Stronger properties are derived for small values of e, which lead to an explicit description of the infinity part and to characterizing the geometry of rational |E|-torsion points. / Data una curva ellittica E su Fp ed un intero e ≥ 1, definiamo un nuovo oggetto, chiamato "loop ellittico", come l'insieme dei punti nel piano proiettivo su Z/p^e Z che stanno sopra ad E, dotato di una operazione ereditata dalla somma di punti sulla curva. Questo oggetto si prova essere un loop algebrico con associatività delle potenze. Le sue sotto-strutture sono investigate utilizzando altre cubiche definite sullo stesso anello, che abbiamo chiamato "curva ombra" e "strati". Quando E ha traccia 1, un comportamento speciale viene notato e sfruttato per produrre un attacco di isomorfismo al problema del logaritmo discreto su questa famiglia di curve. Migliori proprietà vengono trovate per bassi valori di e, che portano ad una descrizione esplicita della parte all'infinito e alla caratterizzazione della geometria dei punti razionali di |E|-torsione.

Many problems in applied mathematics and physics are formulated most naturally in terms of matrices, and can be solved by computing functions of these matrices. For example, in quantum mechanics, the coherent dynamics of physical systems is described by the matrix exponential of their Hamiltonian. In state of the art experiments, one can now observe such unitary evolution of many-body systems, which is of fundamental interest in the study of many-body quantum phenomena. On the other hand the theoretical simulation of such non-equilibrium many-body dynamics is very challenging. In this thesis, we develop a symbolic approach to matrix functions and quantum dynamics based on a novel algebraic structure we identify for sets of walks on graphs. We begin by establishing the graph theoretic equivalent to the fundamental theorem of arithmetic: all the walks on any finite digraph uniquely factorise into products of prime elements. These are the simple paths and simple cycles, walks forbidden from visiting any vertex more than once. We give an algorithm that efficiently factorises individual walks and obtain a recursive formula to factorise sets of walks. This yields a universal continued fraction representation for the formal series of all walks on digraphs. It only involves simple paths and simple cycles and is thus called a path-sum. In the second part, we recast matrix functions into path-sums. We present explicit results for a matrix raised to a complex power, the matrix exponential, matrix inverse, and matrix logarithm. We introduce generalised matrix powers which extend desirable properties of the Drazin inverse to all powers of a matrix. In the third part, we derive an intermediary form of path-sum, called walk-sum, relying solely on physical considerations. Walk-sum describes the dynamics of a quantum system as resulting from the coherent superposition of its histories, a discrete analogue to the Feynman path-integrals. Using walk-sum we simulate the dynamics of quantum random walks and of Rydberg-excited Mott insulators. Using path-sum, we demonstrate many-body Anderson localisation in an interacting disordered spin system. We give two observable signatures of this phenomenon: localisation of the system magnetisation and of the linear magnetic response function. Lastly we return to the study of sets of walks. We show that one can construct as many representations of series of walks as there are ways to define a walk product such that the factorisation of a walk always exist and is unique. Illustrating this result we briefly present three further methods to evaluate functions of matrices. Regardless of the method used, we show that graphs are uniquely characterised, up to an isomorphism, by the prime walks they sustain.

A dinâmica de crescimento populacional de uma espécie é permeada pela relação entre as desvantagens da competição intraespecífica e os benefícios da presença de conspecíficos. Para muitas espécies, os benefícios da cooperação podem superar as desvantagens da competição. A correlação positiva entre tamanho populacional e adaptabilidade em populações muito pequenas é conhecida como efeito Allee demográfico. Apesar de haver modelos matemáticos isolados para os diferentes tipos de efeitos Allee, não há um modelo simples que os abranja e os conecte a modelos de crescimento mais gerais (como o de Richards). Propomos unificar modelos de efeitos Allee e o de crescimento de Richards em um modelo que permita um novo ponto de vista sobre o efeito Allee demográfico. Um exemplo do aumento das possibilidades descritivas de tal generalização é a emergência de mais de uma transição cooperação-competição quando considerado um caso particular desse novo modelo (Allee-Gompertz). Apesar da importância do crescimento populacional, a maioria dos modelos básicos de transmissão de doenças infecciosas considera o tamanho populacional constante ou adota simplificações pouco plausíveis. Nesta tese, mostramos as deficiências de um modelo compartimental dinâmico de tuberculose já consagrado e propomos um novo modelo com crescimento populacional logístico. Quando comparados, nosso modelo apresenta previsões mais pessimistas para a erradicação da doença a longo prazo quando testado com parâmetros que definem políticas de controle pouco eficientes. Realizamos tais predições adotando estratégias de controle de países desenvolvidos e subdesenvolvidos. Visto que esses modelos compartimentais desprezam aspectos espaciais, desenvolvemos uma modelagem computacional de agentes, baseada no modelo proposto, com duas estruturas subjacentes: redes aleatórias e redes reais. A súbita emergência de tuberculose resistente a drogas como consequência de tratamentos ineficazes é também um resultado das implementações desses modelos em dois cenários distintos. Esses resultados são comparados com os do modelo compartimental e com os de um modelo de estrutura subjacente mais simples e, como novo resultado, surge nos dois modelos a possibilidade de erradicação da doença em menos de uma década após o início do tratamento. Esse resultado é possível desde que sejam adotadas estratégias eficientes de controle. / The one-species population growth dynamics is permeated by the relationship between the harms from the intraspecific competition and the benefits from the presence of conspecifics. For many species, the benefits from conspecific cooperation may outweigh the harms from competition. The positive correlation between population size and total fitness in very small population known as demographic Allee effect. Although there are isolated mathematical models for different types of Allee effects, there is not a simple model that covers and connects them to more general growth models (like Richards). We propose to unify models of Allee effects and the Richards growth one in a model that allows a new perspective on the demographic Allee effect. An example of the increased descriptive possibilities of such generalization is the emergence of more than one transition cooperation-competition when considering a particular case of this new model (Gompertz-Allee). Despite the importance of population growth, most basic models of infectious diseases transmission considers population size constant or adopts implausible simplifications. In this thesis, we show the shortcomings of a dynamic compartmental model of tuberculosis already established and we propose a new model with population logistic growth. When compared, our model provides more pessimistic forecasts for the eradication of the disease in the long term if it is tested with parameters that define inefficient control policies. We perform such predictions adopting control strategies from developed and underdeveloped countries. Since these compartmental model disregards spatial aspects, we developed a computational agent model, based on the proposed model, with two underlying structures: random networks and real networks. The sudden emergence of drug-resistant tuberculosis as a result of ineffective treatments is also a result from the implementations of these models in two distinct scenarios. These results are compared with the ones from a compartimental model and with the ones from a model with simpler underlying structure and, as a new result, the possibility of eradicating the disease in less than a decade after beginning the treatment appears on the two models. This result is possible adopting effective control strategies.

Made available in DSpace on 2016-04-27T16:57:04Z (GMT). No. of bitstreams: 1 Adriana Tiago Castro dos Santos.pdf: 7471618 bytes, checksum: 9c75079b97e8ac1990c5f20df0d9a3a8 (MD5) Previous issue date: 2011-02-17 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This study aims at developing, to apply and to analyze a didactic sequence which has involved the logarithm function theme using the software GeoGebra as a pedagogical strategy. For this purpose we have chosen the Registers of Semiotic Representation Theory as theoretical framework, as described by Duval (2009) as well as the Advanced Mathematical Thinking Processes, according to Dreyfus (1991). We have used the project of Didactic Engineering (ARTIGUE, DOUADY, MORENO, 1995) as methodological reference. The activities chosen to compose the sequence were retrieved from Math Teacher´s book of the High School to the first grade third quarter of 2009 (SÃO PAULO, 2009) with some adaptations which we judged necessary. The fellows of this survey were students of a public school in São Paulo State in the town of Itaquaquecetuba who were observed during eight presence meetings. The analyses of the production achieved by the students in connection with the transcriptions of the dialogues recorded in audio during the proposal of the didactic sequence pointed out that there were difficulties in making the conversion from the graphic register in the initial record to the registers: algebraic and in the natural language in the final record. Based on the report of the participants, the use of the software GeoGebra has contributed to the visualization and to the understanding of the graphic performance of the studied functions. The Advanced Mathematical Thinking Processes involved in the strategies of the solutions of the students were: the discovery by using investigation, changing of representation for the same concept, generalization and abstraction. According to Dreyfus (1991) these processes are relevant to the understanding of a mathematical concept. After the analyses of the results we have concluded that the application of the didactical sequences using the software GeoGebra was efficient strategy to achieve our initially proposed objectives / Este estudo tem como objetivo elaborar, aplicar e analisar uma sequência didática que envolveu o tema função logarítmica utilizando o software GeoGebra como uma estratégia pedagógica. Para tanto escolhemos como aporte teórico a Teoria dos Registros de Representação e Semiótica descrita por Duval (2009) e os processos do Pensamento Matemático Avançado segundo Dreyfus (1991). Como referencial metodológico, utilizamos os pressupostos da Engenharia Didática (ARTIGUE, DOUADY, MORENO, 1995). As escolhas das atividades para compor a sequência foram retiradas do Caderno do Professor de Matemática da 1ª Série do Ensino Médio volume 3 (SÃO PAULO, 2009) com algumas adaptações que julgamos necessárias. Os sujeitos da pesquisa foram estudantes do 3º ano do Ensino Médio de uma escola da rede estadual de São Paulo no Município de Itaquaquecetuba, durante oito encontros presenciais. As análises das produções realizadas pelos alunos em conjunto com as transcrições dos diálogos gravados em áudio durante a aplicação da sequência didática apontaram que houve dificuldade em fazer a conversão do registro gráfico no registro de partida para os registros: algébrico e na língua natural no registro de chegada. Segundo relato dos participantes, o uso do software GeoGebra contribuiu para a visualização e para a compreensão do comportamento gráfico das funções estudadas. Os processos do Pensamento Matemático Avançado envolvido nas estratégias de resoluções dos estudantes foram: a descoberta por meio de investigação, mudança de representação de um mesmo conceito, generalização e abstração. Segundo Dreyfus (1991) esses processos são relevantes para a compreensão de um conceito matemático. Após as análises dos resultados concluímos que a aplicação da sequência didática utilizando o software GeoGebra foi uma estratégia eficiente para atingir os nossos objetivos propostos inicialmente

The main aim of my thesis on the topic of "Euler's number in mathematical analysis" is to create an overview of the Euler numbers in calculus. This essay in the first part deals with the rise of the number e, in other parts of the current use of calculus. Purpose of this work is the insight students of secondary schools and universities to problems Euler numbers and to better understand the importance of e not only in mathematics.