Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
Curving Towards Bézout: An Examination Of Plane Curves And Their Intersection, Camron Alexander Robey Cohen
Curving Towards Bézout: An Examination Of Plane Curves And Their Intersection, Camron Alexander Robey Cohen
Honors Papers
One area of interest in studying plane curves is intersection. Namely, given two plane curves, we are interested in understanding how they intersect. In this paper, we will build the machinery necessary to describe this intersection. Our discussion will include developing algebraic tools, describing how two curves intersect at a given point, and accounting for points at infinity by way of projective space. With all these tools, we will prove Bézout’s theorem, a robust description of the intersection between two curves relating the degrees of the defining polynomials to the number of points in the intersection.
A Computational Introduction To Elliptic And Hyperelliptic Curve Cryptography, Nicholas Wilcox
A Computational Introduction To Elliptic And Hyperelliptic Curve Cryptography, Nicholas Wilcox
Honors Papers
At its core, cryptography relies on problems that are simple to construct but difficult to solve unless certain information (the “key”) is known. Many of these problems come from number theory and group theory. One method of obtaining groups from which to build cryptosystems is to define algebraic curves over finite fields and then derive a group structure from the set of points on those curves. This thesis serves as an exposition of Elliptic Curve Cryptography (ECC), preceded by a discussion of some basic cryptographic concepts and followed by a glance into one generalization of ECC: cryptosystems based on hyperelliptic …
Intersection Number Of Plane Curves, Margaret E. Nichols
Intersection Number Of Plane Curves, Margaret E. Nichols
Honors Papers
In algebraic geometry, seemingly geometric problems can be solved using algebraic techniques. Some of the most basic geometric objects we can study are polynomial curves in the plane. In this paper we focus on the intersections of two curves. We address both the number of times two curves intersect at a given point, counting multiplicity (whatever that means), and the total number of intersections of the curves, again counting multiplicity. The former is known as the intersection number of the curves at the point. This concept, although geometrically motivated, can be described in algebraic terms; it is this relationship which …