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

We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a…

We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.

Let $p$ be an odd prime and $\mathbb{F}_p$ be the prime field of order $p$. Consider a $2$-dimensional orthogonal group $G$ over $\mathbb{F}_p$ acting on the standard representation $V$ and the dual space $V^*$. We compute the invariant…

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…

Suppose that $p$ is a prime, $G$ is a finite group and $H$ is a strongly $p$-embedded subgroup in $G$. We consider the possibility that $F^*(H)$ is a simple group of Lie rank 2 defined in characteristic $p$.

We establish a connection between semi-primitive roots of the multiplicative group of integers modulo $2^{k}$ where $k\geq 3$, and the logarithmic base in the algorithm introduced by Fit-Florea and Matula (2004) for computing the discrete…

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…

We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…

A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…

In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.

We prove an $\mathbb F_p$-Selberg integral formula, in which the $\mathbb F_p$-Selberg integral is an element of the finite field $\mathbb F_p$ with odd prime number $p$ of elements. The formula is motivated by analogy between…

In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+\epsilon}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.

We study finite groups which possess a strongly p-embedded subgroup for some odd prime p. The main results of the paper will be applied in the ongoing project to classify the simple groups of local characteristic p.

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation…

We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…