Related papers: Mapping the Discrete Logarithm
Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…
Given a graph G, a subset M of V (G) is a module of G if for each v \in V (G) \diagdownM, v is adjacent to all the elements of M or to none of them. For instance, V(G), \varnothing and {v} (v \in V(G)) are modules of G called trivial. Given…
Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
In this paper a three fuzzy vault schemes which integrated with discrete logarithmic encryption scheme are proposed. In the first scheme, the message m is encoded with discrete logarithmic encryption scheme using randomly generated identity…
We present a deterministic algorithm that, given a prime $p$ and a solution $x \in \mathbb Z$ to the discrete logarithm problem $a^x \equiv b \pmod p$ with $p\nmid a$, efficiently lifts it to a solution modulo $p^k$, i.e., $a^x \equiv b…
Graph Neural Networks (GNNs) have shown remarkable performance in various applications. Recently, graph prompt learning has emerged as a powerful GNN training paradigm, inspired by advances in language and vision foundation models. Here, a…
We say that the sequence $g_n$, $n\ge 3$, $n \rightarrow \infty$ of polynomial transformation bijective maps of free module $K^n$ over commutative ring $K$ is a sequence of stable degree if the order of $g_n$ is growing with $n$ and the…
The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…
We investigate perturbed monomial dynamical system over $\mathbb{F}_p$ given by iterations of $x\mapsto x^n+c\bmod{p}$, where $c\in \mathbb{F}_p$. Instead of study the systems one at a time we study all of them at the same time. The complex…
In cryptanalysis, solving the discrete logarithm problem (DLP) is key to assessing the security of many public-key cryptosystems. The index-calculus methods, that attack the DLP in multiplicative subgroups of finite fields, require solving…
In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…
It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In…
This paper presents a novel algorithm for the modulus operation for FPGA implementation. The proposed algorithm use only addition, subtraction, logical, and bit shift operations, avoiding the complexities and hardware costs associated with…
Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex $C$, from which topological and geometrical informations…
Scientific collaborations benefit from collaborative learning of distributed sources, but remain difficult to achieve when data are sensitive. In recent years, privacy preserving techniques have been widely studied to analyze distributed…
We describe the discrete Fourier transform (DFT) for a cyclic group when $p|N$ by factoring $x^N-1$ over finite fields and constructing the Fourier transform and its inverse using B\'{e}zout's identity for polynomials. For the symmetric…
For a prime p and base b, the digit function delta(r) = floor(br/p) partitions the residues {1, ..., p-1} into b contiguous bins. The collision count C(g) records how many residues share a bin with their image under multiplication by g. We…
A graph $G$ is primarily orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize primarily orientable graphs.