Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algebraic number theory (1)
- Colon Ideal (1)
- Commutative algebra (1)
- Cryptography (1)
- Field (1)
-
- Half factorial domain (1)
- Homomorphic Encryption (1)
- Integral Closure. (1)
- Lattices (1)
- Lyubeznik ideal (1)
- Minimal cover (1)
- Minimal free resolution (1)
- Number field (1)
- Numerical algebraic geometry (1)
- Order (1)
- Post-Quantum Cryptography (1)
- Ring Learning With Errors (1)
- Ring of formal power series (1)
- Rings (1)
- Symbolic computation (1)
- Trace tests (1)
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Efficiency Of Homomorphic Encryption Schemes, Kyle Yates
Efficiency Of Homomorphic Encryption Schemes, Kyle Yates
All Theses
In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …
Conductors And Rings With Shared Ideals, Sydney Maibach
Conductors And Rings With Shared Ideals, Sydney Maibach
All Theses
Given an additive subgroup $I$ of a field $K$, we define the colon ideal (I:I) = {\alpha \in K: \alpha I \subseteq I}. We then use this to construct collections of rings with shared ideals and explore relationships between these concepts and the complete integral closure.
The Hfd Property In Orders Of A Number Field, Grant Moles
The Hfd Property In Orders Of A Number Field, Grant Moles
All Theses
We will examine orders R in a number field K. In particular, we will look at how the generalized class number of R relates to the class number of its integral closure R. We will then apply this to the case when K is a quadratic field to produce a more specific relation. After this, we will focus on orders R which are half-factorial domains (HFDs), in which the irreducible factorization of any element α∈R has fixed length. We will determine two cases in which R is an HFD if and only if its ring of …
Lyubeznik Ideals Minimally Generated By Four Or Fewer Elements, Nathan S. Fontes
Lyubeznik Ideals Minimally Generated By Four Or Fewer Elements, Nathan S. Fontes
All Theses
Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik …
Identifying Trace Affine Linear Sets Using Homotopy Continuation, Julianne Mckay
Identifying Trace Affine Linear Sets Using Homotopy Continuation, Julianne Mckay
All Theses
We investigate how the coefficients of a sparse polynomial system influence the sum, or the trace, of its solutions. We discuss an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of the support of a sparse polynomial system use sparse resultants and polyhedral geometry, respectively. We introduce a new approach which provides more precise classifications of trace affine linear sets than was previously known. For this new approach, we developed software in Macaulay2.