Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Algorithms (3)
- Cryptography (3)
- Number Theory (2)
- Number theory (2)
- Algebraic number theory (1)
-
- Analytic number theory (1)
- Asymmetric Cryptography (1)
- Availability (1)
- Binomial Coefficients (1)
- Carmichael numbers (1)
- Computation (1)
- Computational mathematics and numerical analysis (1)
- Convergence (1)
- Convex analysis (1)
- Diffie-Hellman (1)
- Direct parallel-in-time method (1)
- Discrete Logarithm (1)
- Elliptic Curves (1)
- Factorization (1)
- Farey sequences (1)
- Fixed points (mathematics) (1)
- Grover's Algorithm (1)
- Image (1)
- Image classification (1)
- Implicit backward difference scheme (1)
- Inexact fixed-point proximity algorithm (1)
- Integer Factorization (1)
- Iterative algorithms (1)
- L-functions (1)
- Lasso (1)
- Publication Year
- Publication
- Publication Type
Articles 1 - 13 of 13
Full-Text Articles in Number Theory
A New Parallel-In-Time Direct Inverse Method For Nonlinear Differential Equations, Nail K. Yamaleev, Subhash Paudel
A New Parallel-In-Time Direct Inverse Method For Nonlinear Differential Equations, Nail K. Yamaleev, Subhash Paudel
Mathematics & Statistics Faculty Publications
We propose a new method for parallelization of the first-order backward difference discretization (BDF1) of the first-order time derivative in nonlinear partial differential equations, such as conservation law equations. The time derivative term is discretized by using the method of lines based on the implicit BDF1 scheme, while the inviscid and viscous terms are approximated by conventional 2nd-order central discretizations of the 1st- and 2nd-order derivatives in each spatial direction. The global system of nonlinear discrete equations in the space-time domain is solved by the Newton method for all time levels simultaneously. For the BDF1 discretization, this all-at-once system at …
Algorithms For Order Statistics In Farey Sequences: A Computational Study, Connor Weyers
Algorithms For Order Statistics In Farey Sequences: A Computational Study, Connor Weyers
School of Computing: Dissertations, Theses, and Student Research
Farey sequences are the sets of irreducible fractions in increasing order with denominator less or equal to some integer n. They are a well-known concept in number theory problems and are related to many other concepts in number theory including integer factoring, Fibonacci sequences, and Riemann’s Zeta function. In this paper, we investigate some known algorithms to solve certain problems in Farey sequences from a computational perspective. In particular, we implement established algorithms that have not been previously implemented with the goal of creating a package that can be used more broadly. We also develop a new algorithm for rational …
Murmurations And Root Numbers, Alexey Pozdnyakov
Murmurations And Root Numbers, Alexey Pozdnyakov
University Scholar Projects
We report on a machine learning investigation of large datasets of elliptic curves and L-functions. This leads to the discovery of murmurations, an unexpected correlation between the root numbers and Dirichlet coefficients of L-functions. We provide a formal definition of murmurations, describe the connection with 1-level density, and provide three examples for which the murmuration phenomenon has been rigorously proven. Using our understanding of murmurations, we then build new machine learning models in search of a polynomial time algorithm for predicting root numbers. Based on our models and several heuristic arguments, we conclude that it is unlikely for …
Inexact Fixed-Point Proximity Algorithm For The ℓ₀ Sparse Regularization Problem, Ronglong Fang, Yuesheng Xu, Mingsong Yan
Inexact Fixed-Point Proximity Algorithm For The ℓ₀ Sparse Regularization Problem, Ronglong Fang, Yuesheng Xu, Mingsong Yan
Mathematics & Statistics Faculty Publications
We study inexact fixed-point proximity algorithms for solving a class of sparse regularization problems involving the ℓ₀ norm. Specifically, the ℓ₀ model has an objective function that is the sum of a convex fidelity term and a Moreau envelope of the ℓ₀ norm regularization term. Such an ℓ₀ model is non-convex. Existing exact algorithms for solving the problems require the availability of closed-form formulas for the proximity operator of convex functions involved in the objective function. When such formulas are not available, numerical computation of the proximity operator becomes inevitable. This leads to inexact iteration algorithms. We investigate in this …
The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson
The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson
Cybersecurity Undergraduate Research Showcase
The RSA encryption algorithm has secured many large systems, including bank systems, data encryption in emails, several online transactions, etc. Benefiting from the use of asymmetric cryptography and properties of number theory, RSA was widely regarded as one of most difficult algorithms to decrypt without a key, especially since by brute force, breaking the algorithm would take thousands of years. However, in recent times, research has shown that RSA is getting closer to being efficiently decrypted classically, using algebraic methods, (fully cracked through limited bits) in which elliptic-curve cryptography has been thought of as the alternative that is stronger than …
Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel
Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel
CSB and SJU Distinguished Thesis
Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants known as RLWE and PLWE have been shown to be more efficient, but the increased structure can leave them vulnerable to attacks for certain instantiations. This work aims to identify specific cases where proposed cryptographic schemes based on PLWE work particularly poorly under a specific attack.
Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas
Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas
Open Educational Resources
The first objective of this book is to define and discuss the meaning of truth in mathematics. We explore logics, both propositional and first-order , and the construction of proofs, both formally and human-targeted. Using the proof tools, this book then explores some very fundamental definitions of mathematics through set theory. This theory is then put in practice in several applications. The particular (but quite widespread) case of equivalence and order relations is studied with detail. Then we introduces sequences and proofs by induction, followed by number theory. Finally, a small introduction to combinatorics is …
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
University Scholar Projects
The Riemann Hypothesis, posed in 1859 by Bernhard Riemann, is about zeros
of the Riemann zeta-function in the complex plane. The zeta-function can be repre-
sented as a sum over positive integers n of terms 1/ns when s is a complex number
with real part greater than 1. It may also be represented in this region as a prod-
uct over the primes called an Euler product. These definitions of the zeta-function
allow us to find other representations that are valid in more of the complex plane,
including a product representation over its zeros. The Riemann Hypothesis says that
all …
Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke
Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke
Honors Program: Senior Projects (Public)
In this thesis, Pascal's Triangle modulo n will be explored for n prime and n a prime power. Using the results from the case when n is prime, a novel proof of Lucas' Theorem is given. Additionally, using both the results from the exploration of Pascal's Triangle here, as well as previous results, an efficient algorithm for computation of binomial coefficients modulo n (a choose b mod n) is described, and its time complexity is analyzed and compared to naive methods. In particular, the efficient algorithm runs in O(n log(a)) time (as opposed to …
Quantum Attacks On Modern Cryptography And Post-Quantum Cryptosystems, Zachary Marron
Quantum Attacks On Modern Cryptography And Post-Quantum Cryptosystems, Zachary Marron
Senior Honors Theses
Cryptography is a critical technology in the modern computing industry, but the security of many cryptosystems relies on the difficulty of mathematical problems such as integer factorization and discrete logarithms. Large quantum computers can solve these problems efficiently, enabling the effective cryptanalysis of many common cryptosystems using such algorithms as Shor’s and Grover’s. If data integrity and security are to be preserved in the future, the algorithms that are vulnerable to quantum cryptanalytic techniques must be phased out in favor of quantum-proof cryptosystems. While quantum computer technology is still developing and is not yet capable of breaking commercial encryption, these …
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Algorithmic Factorization Of Polynomials Over Number Fields, Christian Schulz
Mathematical Sciences Technical Reports (MSTR)
The problem of exact polynomial factorization, in other words expressing a polynomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used …
Tabulating Pseudoprimes And Tabulating Liars, Andrew Shallue
Tabulating Pseudoprimes And Tabulating Liars, Andrew Shallue
Scholarship
This paper explores the asymptotic complexity of two problems related to the Miller-Rabin-Selfridge primality test. The first problem is to tabulate strong pseudoprimes to a single fixed base $a$. It is now proven that tabulating up to $x$ requires $O(x)$ arithmetic operations and $O(x\log{x})$ bits of space. The second problem is to find all strong liars and witnesses, given a fixed odd composite $n$. This appears to be unstudied, and a randomized algorithm is presented that requires an expected $O((\log{n})^2 + |S(n)|)$ operations (here $S(n)$ is the set of strong liars). Although interesting in their own right, a notable application …
Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue
Constructing Carmichael Numbers Through Improved Subset-Product Algorithms, W.R. Alford, Jon Grantham, Steven Hayman, Andrew Shallue
Scholarship
style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed Carmichael numbers with style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> prime factors for every style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;"> between 3 and 19,565,220. These computations are the product of implementations of two new algorithms for the subset product problem that exploit the non-uniform distribution of primes style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">with the property that …