Related papers: Computing discrete logarithms in subfields of resi…
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…
Given a finite residue field $k$, one looks for a smoothness basis that is invariant under the automorphism group of $k$. We construct models for some finite fields that admit such a basis. This work aims at accelerating algorithms for…
The computation of the cohomology for finite groups of Lie type in the describing characteristic is a challenging and difficult problem. In earlier work, the authors constructed an induction functor which takes modules over the finite group…
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…
The discrete logarithm problem is a fundamental challenge in number theory with significant implications for cryptographic protocols. In this paper, we investigate the limitations of gradient-based methods for learning the parity bit of the…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
This paper studies the structure of finite hyperfields $H$, and finds a subtle pattern in their addition operation. Consider the class $\mathcal{H}$ of all hyperfields with a given multiplicative group on $H^\times = H - \{0\}$ and given…
General concept of a gradation slicing is used to analyze polynomial solutions of ordinary differential equations (ODE) with polynomial coefficients, ${\cal L}\psi=0$, where ${\cal L}=\sum_l p_l(z) d_z^l$, $p_l(z)$ are polynomials, $z$ is a…
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…
Using Atiyah-Bott localization on the space of stable maps to the stack quotient $[\mathbb{P}^1/\mathbb{Z}_2]$, we find recursions that determine all Hodge integrals with descendent insertions at one marked point on the hyperelliptic locus…
The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
We establish new measures of linear independence of logarithms on commutative algebraic groups in the so-called \emph{rational case}. More precisely, let k be a number field and v_{0} be an arbitrary place of k. Let G be a commutative…
Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…
We study the last fall degrees of {\em semi-local} polynomial systems, and the computational complexity of solving such systems for closed-point and rational-point solutions, where the systems are defined over a finite field. A semi-local…
In this paper, as an extension of the integer case, we define polynomial functions over the residue class rings of Dedekind domains, and then we give canonical representations and counting formulas for such polynomial functions. In…
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…
In mixed finite element approximations of Hodge Laplace problems associated with the de Rham complex, the exterior derivative operators are computed exactly, so the spatial locality is preserved. However, the numerical approximations of the…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Forman's Discrete Morse theory is studied from an algebraic viewpoint. Analogous to independent work of Emil Skoeldberg we show that this theory can be extended to chain complexes of free modules over a ring. We provide three applications…