Related papers: Mapping the Discrete Logarithm
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
A modulator of a graph G to a specified graph class H is a set of vertices whose deletion puts G into H. The cardinality of a modulator to various tractable graph classes has long been used as a structural parameter which can be exploited…
The "self-power" map $x \mapsto x^x$ modulo $m$ and its generalized form $x \mapsto x^{x^n}$ modulo $m$ are of considerable interest for both theoretical reasons and for potential applications to cryptography. In this paper, we use $p$-adic…
For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
We contribute to the knowledge of linear codes from special polynomials and functions, which have been studied intensively in the past few years. Such codes have several applications in secret sharing, authentication codes, association…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
Let $p$ be an odd prime. For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to\{1,2,\ldots,n\}$ is said to be a Legendre cordial labeling modulo $p$ if the induced function $f_p^*:E(G)\to \{0,1\}$, defined by $f_p^*…
Verifying graph algorithms has long been considered challenging in separation logic, mainly due to structural sharing between graph subcomponents. We show that these challenges can be effectively addressed by representing graphs as a…
In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation.…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
In a recent paper, Grau et al. (2017) studied the zero divisor graphs of the ring of Lipschitz integers modulo $n$, and computed the domination number of the undirected zero divisor graph of the ring of Lipschitz integers modulo $n$. But…
We propose a new symmetric cryptographic scheme based on functional invariants defined over discrete oscillatory functions with hidden parameters. The scheme encodes a secret integer through a four-point algebraic identity preserved under…
The Bivariate Function Hard Problem (BFHP) has been in existence implicitly in almost all number theoretic based cryptosystems. This work defines the BFHP in a more general setting and produces an efficient asymmetric cryptosystem. The…
We initiate an empirical investigation into differentially private graph neural networks on population graphs from the medical domain by examining privacy-utility trade-offs at different privacy levels on both real-world and synthetic…
We study the model $G_\alpha\cup G(n,p)$ of randomly perturbed dense graphs, where $G_\alpha$ is any $n$-vertex graph with minimum degree at least $\alpha n$ and $G(n,p)$ is the binomial random graph. We introduce a general approach for…
A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…
We present a framework for designing differentially private (DP) mechanisms for binary functions via a graph representation of datasets. Datasets are nodes in the graph and any two neighboring datasets are connected by an edge. The true…
Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on its set of conjugacy class sizes: this is the (simple undirected) graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, and two…