Related papers: A Deterministic Cryptographic Prime Generation Cha…

We study the splitting of primes in number fields generated by points on modular curves. Momose was the first to notice that quadratic points on $X_1(n)$ generate quadratic fields over which certain primes split in a particular way and his…

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

We give a new algorithm for constructing Picard curves over a finite field with a given endomorphism ring. This has important applications in cryptography since curves of genus 3 allow for smaller key sizes than elliptic curves. For a…

The s-box plays the vital role of creating confusion between the ciphertext and secret key in any cryptosystem, and is the only nonlinear component in many block ciphers. Dynamic s-boxes, as compared to static, improve entropy of the…

A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword C(x), even after some constant…

Let us consider the pure quartic fields of the form $\K=\Q(\sqrt[4]{p})$ where $0<p\equiv 7\pmod{16}$ is a prime integer. We prove that the $2$-class group of $\K$ has order $2$. As a consequence of this, if the class number of $\K$ is $2$,…

For positive integers $a$ and $b$, we let $[U_n]$ be the Lucas sequence of the first kind defined by \[U_0=0,\quad U_1=1\quad \mbox{and} \quad U_n=aU_{n-1}+bU_{n-2} \quad \mbox{ for $n\ge 2$},\] and let $\pi(m):=\pi_{(a,b)}(m)$ be the…

A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering…

There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generators can be built from each other, and thus require equivalent…

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

A positive square-free integer is called a \textit{congruent number} if it arises as the area of a right triangle with rational side lengths. Let $ n = p_1p_2 \cdots p_t q $ be a square-free integer, where each $ p_i \equiv 1 \pmod{8} $ and…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as…

We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…

For arbitrary positive integers $q_1 \ge q_2 \ge q_3 \ge \cdots$ we construct a family of monomial ideals such that for each positive integer $e$ and for each ideal $I$ in the family, the number of associated primes of $I^e$ is the $q_e$.…

The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It…

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to…

In this paper, for any nonic number field $K$ generated by a root $\alpha$ of a monic irreducible trinomial $F(x)=x^9+ax+b \in \mathbb{Z}[x]$ and for every rational prime $p$, we characterize when $p$ divides the index of $K$. We also…

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…