<p> A definition of polynomial differentiability of an arc in the real affine plane at a point is given. The differentiable points are classified with respect to the intersection and support properties of certain families of osculating polynomials. For a given point of an arc, these properties are used to define a certain n-tuple of integers, the characteristic of that point. It is shown that the polynomial order of polynomially differentiable interior point of an arc is at least as great as the sum of the digits of its characteristic.</p> / Thesis / Doctor of Philosophy (PhD)

<p> This thesis examines continued fraction expansions of the square root of nonsquare positive integers of periods one to six, and shows their relationships with Newton's method of approximation. It also contains known results concerning continued fractions.</p> / Thesis / Master of Science (MSc)

No description available.

<p>In this thesis it is investigated if representing a field <i>Z</i><i>p</i><i>, p</i> = 1 (mod 4) prime, by another field <i>Z[i]</i>/ < <i>a + bi </i>> over the gaussian integers, with <i>p</i> = <i>a</i><i>2</i><i> + b</i><i>2</i>, results in arithmetic architectures using a smaller number of logic gates. Only bit parallell architectures are considered and the programs Espresso and SIS are used for boolean minimization of the architectures. When counting gates only NAND, NOR and inverters are used.</p><p>Two arithmetic operations are investigated, addition and multiplication. For addition the architecture over<i> Z[i]/ < a+bi ></i> uses a significantly greater number of gates compared with an architecture over<i> Z</i><i>p</i>. For multiplication the architecture using gaussian integers uses a few less gates than the architecture over <i>Z</i><i>p</i> for <i>p</i> = 5 and for<i> p</i> = 17 and only a few more gates when <i>p</i> = 13. Only the values 5, 13, 17 have been compared for multiplication. For addition 12 values, ranging from 5 to 525313, have been compared.</p><p>It is also shown that using a blif model as input architecture to SIS yields much better performance, compared to a truth table architecture, when minimizing.</p>

NTRU is a fast public-key cryptosystem that is constructed using polynomial rings with integer coefficients. We present ETRU, an NTRU-like cryptosystem based on the Eisenstein integers. We discuss parameter selection and develop a model for the probabilty of decryption failure. We also provide an implementation of ETRU. We use theoretical and experimental data to compare the security and efficiency of ETRU to NTRU with comparable parameter sets and show that ETRU is an improvement over NTRU in terms of security.

NTRU is a fast public-key cryptosystem that is constructed using polynomial rings with integer coefficients. We present ETRU, an NTRU-like cryptosystem based on the Eisenstein integers. We discuss parameter selection and develop a model for the probabilty of decryption failure. We also provide an implementation of ETRU. We use theoretical and experimental data to compare the security and efficiency of ETRU to NTRU with comparable parameter sets and show that ETRU is an improvement over NTRU in terms of security.

In this thesis it is investigated if representing a field Zp, p = 1 (mod 4) prime, by another field Z[i]/ &lt; a + bi &gt; over the gaussian integers, with p = a2 + b2, results in arithmetic architectures using a smaller number of logic gates. Only bit parallell architectures are considered and the programs Espresso and SIS are used for boolean minimization of the architectures. When counting gates only NAND, NOR and inverters are used. Two arithmetic operations are investigated, addition and multiplication. For addition the architecture over Z[i]/ &lt; a+bi &gt; uses a significantly greater number of gates compared with an architecture over Zp. For multiplication the architecture using gaussian integers uses a few less gates than the architecture over Zp for p = 5 and for p = 17 and only a few more gates when p = 13. Only the values 5, 13, 17 have been compared for multiplication. For addition 12 values, ranging from 5 to 525313, have been compared. It is also shown that using a blif model as input architecture to SIS yields much better performance, compared to a truth table architecture, when minimizing.

NTRU is a fast public-key cryptosystem that is constructed using polynomial rings with integer coefficients. We present ETRU, an NTRU-like cryptosystem based on the Eisenstein integers. We discuss parameter selection and develop a model for the probabilty of decryption failure. We also provide an implementation of ETRU. We use theoretical and experimental data to compare the security and efficiency of ETRU to NTRU with comparable parameter sets and show that ETRU is an improvement over NTRU in terms of security.

This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.

nÃo hà / Este trabalho apresenta TÃpicos de AritmÃtica, relacionados com o estudo da divisÃo, para aplicaÃÃo em sala de aula no Ensino MÃdio, cujo o propÃsito à buscar o aprofundamento dos conhecimentos de AritmÃtica que os alunos adquirem no Ensino Fundamental. Iniciamos com a abordagem das principais propriedades dos divisores, o algoritmo da divisÃo e o lema dos restos. Em seguida, estudamos os nÃmeros primos com especial atenÃÃo ao Teorema Fundamental da AritmÃtica, de importÃncia capital na obtenÃÃo de muitos resultados importantes nesse texto. Mais adiante, sÃo apresentadas as definiÃÃes de mÃximo divisor comum e mÃnimo mÃltiplo comum bem como as caracterizaÃÃes, propriedades e a interpretaÃÃo geomÃtrica. Como proposta de continuidade aos estudos sobre divisÃo no Ensino MÃdio, apresentamos um estudo elementar sobre as congruÃncias mÃdulo m e sua aplicaÃÃo na demonstraÃÃo dos critÃrios de divisibilidade. Por fim, expomos um relatÃrio de aplicaÃÃo dos tÃpicos desse trabalho em sala de aula. / This paper presents arithmetic topics related to the study of the division, for use in the high school classroom, whose purpose is to seek further knowledge of arithmetic that the students learn in elementary school. We begin with the approach of the main properties of divisors, the division algorithm and the motto of the remains. Then we study the prime numbers with special attention to the fundamental theorem of arithmetic, of paramount importance in achieving many important results in this text. Further down, the definitions of greatest common divisor and least common multiple and the characterizations, properties and geometric interpretation. As a proposal for continuing the studies of division in high school, we present an elementary study about the congruence module m and its application in demonstrating of the criteria for divisibility. Finally, we expose an implementation report of the topics of this paper in the classroom.