Related papers: A Short Note on Discrete Log Problem in $F_p$

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Let $p$ be an odd prime, and define $$G_p(x)=\prod_{k=1}^{(p-1)/2}\left(x-e^{2\pi i k^2/p}\right).$$ In this paper we study values of $G_p(x)$ at roots of unity via Galois theory, and confirm some previous conjectures. For example, for any…

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an…

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

In this paper, we describe some arithmetic properties of Lame operators with finite dihedral projective monodromy. We take advantage of the deep link with Grothendieck's theory of dessins d'enfants. We focus more particularly on the case of…

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_\Lambda f(n) := \sup_{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e^{2\pi i \lambda p}}{p} |,\] where…

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…

Fix an odd prime $p$, and let $F$ be a field containing a primitive $p$th root of unity. It is known that a $p$-rigid field $F$ is characterized by the property that the Galois group $G_F(p)$ of the maximal $p$-extension $F(p)/F$ is a…

In this paper we study the existence of at least one non-inner automorphism of order p in a finite normally constrained p-group when p is an odd prime.

The finite element method can be viewed as a machine that automates the discretization of differential equations, taking as input a variational problem, a finite element and a mesh, and producing as output a system of discrete equations.…

We present a method to solve fractional optimal control problems, where the dynamic depends on integer and Caputo fractional derivatives. Our approach consists to approximate the initial fractional order problem with a new one that involves…

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

In this paper, we first find the distribution of nth power residues modulo a prime $p$ by analyzing sums involving Dirichlet characters. We then extend this method to characterize the distribution of powers in arbitrary finite fields.

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…

In this short note we introduce a new metric on certain finite groups. It leads to a class of groups for which the element orders satisfy an interesting inequality. This extends the class CP_2 studied in our previous paper [16].

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.