Number Theory Commons^™

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 …

Proving Dirichlet's Theorem On Arithmetic Progressions, Owen T. Abma

Undergraduate Student Research Internships Conference

First proved by German mathematician Dirichlet in 1837, this important theorem states that for coprime integers a, m, there are an infinite number of primes p such that p = a (mod m). This is one of many extensions of Euclid’s theorem that there are infinitely many prime numbers. In this paper, we will formulate a rather elegant proof of Dirichlet’s theorem using ideas from complex analysis and group theory.

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

A Strange Attractor Of Primes, Alexander Hare

ONU Student Research Colloquium

The greatest prime factor sequences (GPF sequences), born at ONU in 2005, are integer sequences satisfying recursions in which every term is the greatest prime factor of a linear combination with positive integer coefficients of the preceding k terms (where k is the order of the sequence), possibly including a positive constant. The very first GPF sequence that was introduced satisfies the recursion x(n+1)=GPF(2*x(n)+1). In 2005 it was conjectured that no matter the seed, this particular GPF sequence enters the limit cycle (attractor) 3-7-5-11-23-47-19-13. In our current work, of a computational nature, we introduce the functions “depth” – where depth(n) …

Contemporary Mathematical Approaches To Computability Theory, Luis Guilherme Mazzali De Almeida

Undergraduate Student Research Internships Conference

In this paper, I present an introduction to computability theory and adopt contemporary mathematical definitions of computable numbers and computable functions to prove important theorems in computability theory. I start by exploring the history of computability theory, as well as Turing Machines, undecidability, partial recursive functions, computable numbers, and computable real functions. I then prove important theorems in computability theory, such that the computable numbers form a field and that the computable real functions are continuous.

The Last Digits Of Infinity (On Tetrations Under Modular Rings), William Stowe

Celebration of Learning

A tetration is defined as repeated exponentiation. As an example, 2 tetrated 4 times is 2^(2^(2^2)) = 2^16. Tetrated numbers grow rapidly; however, we will see that when tetrating where computations are performed mod n for some positive integer n, there is convergent behavior. We will show that, in general, this convergent behavior will always show up.

Lecture 10, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Continuation of Fyodorov--Keating conjectures, connections with random multiplicative functions.

Lecture 9, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Fyodorov--Keating conjectures, connections with random multiplicative functions.

The Weyl Bound For Dirichlet L-Functions, Matthew P. Young

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Abstract: In the 1960's, Burgess proved a subconvexity bound for Dirichlet L-functions. However, the quality of this bound was not as strong, in terms of the conductor, as the classical Weyl bound for the Riemann zeta function. In a major breakthrough, Conrey and Iwaniec established the Weyl bound for quadratic Dirichlet L-functions. I will discuss recent work with Ian Petrow that generalizes the Conrey-Iwaniec bound for more general characters, in particular arbitrary characters of prime modulus.

Extension Of A Positivity Trick And Estimates Involving L-Functions At The Edge Of The Critical Strip, Xiannan Li

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Updated schedule

Abstract: I will review an old trick, and relate this to some modern results involving estimates for L-functions at the edge of the critical strip. These will include a good bound for automorphic L-functions and Rankin-Selberg L-functions as well as estimates for primes which split completely in a number field.

Lecture 8, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Continuation of Extreme values of L-functions.

Lecture 7, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Extreme values of L-functions.

Lecture 6, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Continuation of Progress towards moment conjectures -- upper and lower bounds.

Lecture 5, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Progress towards moment conjectures -- upper and lower bounds.

High Moments Of L-Functions, Vorrapan Chandee

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Abstract: Moments of L-functions on the critical line (Re(s) = 1/2) have been extensively studied due to numerous applications, for example, bounds for L-functions, information on zeros of L-functions, and connections to the generalized Riemann hypothesis. However, the current understanding of higher moments is very limited. In this talk, I will give an overview how we can achieve asymptotic and bounds for higher moments by enlarging the size of various families of L-functions and show some techniques that are involved.

Moments Of Cubic L-Functions Over Function Fields, Alexandra Florea

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Abstract: I will talk about some recent work with Chantal David and Matilde Lalin about the mean value of L-functions associated to cubic characters over F_q[t] when q=1 (mod 3). I will explain how to obtain an asymptotic formula which relies on obtaining cancellation in averages of cubic Gauss sums over functions fields. I will also talk about the corresponding non-Kummer case when q=2 (mod 3) and I will explain why this setting is somewhat easier to handle than the Kummer case, which allows us to prove some better results.

Lecture 4, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Larger values of L-functions on critical line -- moments, conjectures.

Lecture 3, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Continuation of Selberg's central limit theorem and analogues in families of L-functions (typical size of values on critical line).

An Effective Chebotarev Density Theorem For Families Of Fields, With An Application To Class Groups, Caroline Turnage-Butterbaugh

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

This talk will present an effective Chebotarev theorem that holds for all but a possible zero-density subfamily of certain families of number fields of fixed degree. For certain families, this work is unconditional, and in other cases it is conditional on the strong Artin conjecture and certain conjectures on counting number fields. As an application, we obtain nontrivial average upper bounds on ℓ-torsion in the class groups of the families of fields.

Landau-Siegel Zeros And Their Illusory Consequences, Kyle Pratt

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Updated time

Abstract: Researchers have tried for many years to eliminate the possibility of LandauSiegel zeros—certain exceptional counterexamples to the Generalized Riemann Hypothesis. Often one thinks of these zeros as being a severe nuisance, but there are many situations in which their existence allows one to prove spectacular, though illusory, results. I will review some of this history and some of these results. In the latter portion of the talk I will discuss recent work, joint with H. M. Bui and Alexandru Zaharescu, in which we show that the existence of Landau-Siegel zeros has implications for the behavior of Dirichlet …

Lecture 2, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Selberg's central limit theorem and analogues in families of L-functions (typical size of values on critical line).

Lecture 1, Kannan Soundararajan

NSF-CBMS Conference: L-functions and Multiplicative Number Theory

Introduction to the rest of lectures + value distribution of L-functions away from critical line.

Experience Of A Noyce-Student Learning Assistant In An Inquiry-Based Learning Class, Melissa Riley

UNO Student Research and Creative Activity Fair

This presentation refers to an undergraduate course called introduction to abstract mathematics at the University of Nebraska at Omaha. During the academic year 2017-2018, undergraduate, mathematics student Melissa Riley was a Noyce-student learning assistant for the Inquiry Based Learning (IBL) section of the course. She assisted the faculty-in-charge with all aspects of the course. These included: materials preparation, class organization, teamwork, class leading, presentations, and tutoring. This presentation shall address some examples of how the IBL approach can be used in this type of class including: the structure of the course, the activities and tasks performed by the students, learning …

Generalizations And Algebraic Structures Of The Grøstl-Based Primitives, Dmitriy Khripkov, Nicholas Lacasse, Bai Lin, Michelle Mastrianni, Liljana Babinkostova (Mentor)

Idaho Conference on Undergraduate Research

With the large scale proliferation of networked devices ranging from medical implants like pacemakers and insulin pumps, to corporate information assets, secure authentication, data integrity and confidentiality have become some of the central goals for cybersecurity. Cryptographic hash functions have many applications in information security and are commonly used to verify data authenticity. Our research focuses on the study of the properties that dictate the security of a cryptographic hash functions that use Even-Mansour type of ciphers in their underlying structure. In particular, we investigate the algebraic design requirements of the Grøstl hash function and its generalizations. Grøstl is an …