Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- 05A15 Exact enumeration problems (2)
- Elliptic curve (2)
- 05-02 Combinatorics Research exposition (1)
- 05B45 Tessellation and tiling problems (1)
- 68P25 Data encryption (1)
-
- 94A60 Cryptography (1)
- Algebraic integers (1)
- Chromatic Polynomials (1)
- Combinatorics (1)
- Congruence (1)
- Congruent number (1)
- Congruent number problem (1)
- Counting (1)
- Critical group (1)
- Cryptanalysis (1)
- Cryptography (1)
- Customer satisfaction (1)
- Discrete logarithm (1)
- Elliptic curves (1)
- Graph Theory (1)
- Knots (1)
- LDA (1)
- Latent topic (1)
- Musiker (1)
- Number theory (1)
- Orbital Chromatic Polynomials (1)
- Perceived value (1)
- Polynomials (1)
- Price perception (1)
- Prime set (1)
Articles 1 - 9 of 9
Full-Text Articles in Physical Sciences and Mathematics
An Exposition Of Kasteleyn's Solution Of The Dimer Model, Eric Stucky
An Exposition Of Kasteleyn's Solution Of The Dimer Model, Eric Stucky
HMC Senior Theses
In 1961, P. W. Kasteleyn provided a baffling-looking solution to an apparently simple tiling problem: how many ways are there to tile a rectangular region with dominos? We examine his proof, simplifying and clarifying it into this nearly self-contained work.
A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley
A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley
Scripps Senior Theses
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this asymmetry that makes it secure.
This paper describes the mathematics (and some of the computer science) necessary to understand and compute an attack on the elliptic curve discrete logarithm problem that works in a special case. The algorithm, proposed by Nigel Smart, renders the elliptic curve discrete logarithm problem easy in both directions for elliptic curves of …
A Combinatorial Exploration Of Elliptic Curves, Matthew Lam
A Combinatorial Exploration Of Elliptic Curves, Matthew Lam
HMC Senior Theses
At the intersection of algebraic geometry, number theory, and combinatorics, an interesting problem is counting points on an algebraic curve over a finite field. When specialized to the case of elliptic curves, this question leads to a surprising connection with a particular family of graphs. In this document, we present some of the underlying theory and then summarize recent results concerning the aforementioned relationship between elliptic curves and graphs. A few results are additionally further elucidated by theory that was omitted in their original presentation.
A Plausibly Deniable Encryption Scheme For Personal Data Storage, Andrew Brockmann
A Plausibly Deniable Encryption Scheme For Personal Data Storage, Andrew Brockmann
HMC Senior Theses
Even if an encryption algorithm is mathematically strong, humans inevitably make for a weak link in most security protocols. A sufficiently threatening adversary will typically be able to force people to reveal their encrypted data. Methods of deniable encryption seek to mend this vulnerability by allowing for decryption to alternate data which is plausible but not sensitive. Existing schemes which allow for deniable encryption are best suited for use by parties who wish to communicate with one another. They are not, however, ideal for personal data storage. This paper develops a plausibly-deniable encryption system for use with personal data storage, …
Chromatic Polynomials And Orbital Chromatic Polynomials And Their Roots, Jazmin Ortiz
Chromatic Polynomials And Orbital Chromatic Polynomials And Their Roots, Jazmin Ortiz
HMC Senior Theses
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is the number of proper k colorings of the graph. We can then find the orbital chromatic polynomial of a graph and a group of automorphisms of the graph, which is a polynomial whose value at a positive integer k is the number of orbits of k-colorings of a graph when acted upon by the group. By considering the roots of the orbital chromatic and chromatic polynomials, the similarities and differences of these polynomials is studied. Specifically we work toward proving a conjecture …
Elliptic Curves And The Congruent Number Problem, Jonathan Star
Elliptic Curves And The Congruent Number Problem, Jonathan Star
CMC Senior Theses
In this paper we explain the congruent number problem and its connection to elliptic curves. We begin with a brief history of the problem and some early attempts to understand congruent numbers. We then introduce elliptic curves and many of their basic properties, as well as explain a few key theorems in the study of elliptic curves. Following this, we prove that determining whether or not a number n is congruent is equivalent to determining whether or not the algebraic rank of a corresponding elliptic curve En is 0. We then introduce L-functions and explain the Birch and …
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
CMC Senior Theses
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.
Enhancement On Counting Invariant On Symmetric Virtual Biracks, Melinda Ho
Enhancement On Counting Invariant On Symmetric Virtual Biracks, Melinda Ho
Scripps Senior Theses
This thesis introduces a new enhancement for virtual birack counting invariants. We first introduce knots and other general types of knots (oriented knots, framed knots, racks, and biracks). Then we’ll discuss the methods, knot invariants, mathematicians use to identify whether two knots are different. Next we’ll look at knots with virtual crossings and knots with a good involution. Finally, we introduce a new symmetric enhancement for virtual birack counting invariants and provide an example.
Price, Perceived Value And Customer Satisfaction: A Text-Based Econometric Analysis Of Yelp! Reviews, Eleanor A. Dwyer
Price, Perceived Value And Customer Satisfaction: A Text-Based Econometric Analysis Of Yelp! Reviews, Eleanor A. Dwyer
Scripps Senior Theses
We examine the antecedents of customer satisfaction in the restaurant sector, paying particular attention to perceived value and price level. Using Latent Dirichlet Allocation, we extract latent topics from the text of Yelp! reviews, then analyze the relationship between these topics and satisfaction, measured as the difference between review rating and user average review rating.