相关论文: Mapping the Discrete Logarithm

Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…

For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…

We extend symbolic protocol analysis to apply to protocols using Diffie-Hellman operations. Diffie-Hellman operations act on a cyclic group of prime order, together with an exponentiation operator. The exponents form a finite field. This…

A $p$-divisible group over a field $K$ admits a slope decomposition; associated to each slope $\lambda$ is an integer $m$ and a representation $\gal(K) \ra \gl_m(D_\lambda)$, where $D_\lambda$ is the $\rat_p$-division algebra with Brauer…

We consider an application to the discrete log problem using completely regular semigroups which may provide a more secure symmetric cryptosystem than the classic system based on groups. In particular we describe a scheme that would appear…

Sampling algorithms, hypergraph degree sequences, and polytopes play a crucial role in statistical analysis of network data. This article offers a brief overview of open problems in this area of discrete mathematics from the point of view…

Let p be a prime. Uniform pro-p groups play a central role in the theory of p-adic Lie groups. Indeed, a topological group admits the structure of a p-adic Lie group if and only if it contains an open pro-p subgroup which is uniform.…

Several complexity measures such as degree, sparsity and multiplicative index for cryptographic functions including the Diffie-Hellman mapping and the discrete logarithm in a finite field have been studied in the literature. In 2022, Reis…

Cryptographic hash functions from expander graphs were proposed by Charles, Goren, and Lauter in [CGL] based on the hardness of finding paths in the graph. In this paper, we propose a new candidate for a hash function based on the hardness…

Learning the similarity between structured data, especially the graphs, is one of the essential problems. Besides the approach like graph kernels, Gromov-Wasserstein (GW) distance recently draws big attention due to its flexibility to…

The Welch map $x \rightarrow g^{x-1+c}$ is similar to the discrete exponential map $x \rightarrow g^x$, which is used in many cryptographic applications including the ElGamal signature scheme. This paper analyzes the number of solutions to…

We present the notion of \emph{reasonable utility} for binary mechanisms, which applies to all utility functions in the literature. This notion induces a partial ordering on the performance of all binary differentially private (DP)…

Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…

Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…

The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…

Let $p$ be an odd prime number. Denote by $GL_n = GL(n,\mathbb F_p)$ the general linear group over the prime field $\mathbb F_p$. Each subgroup of $GL_n$ acts on the algebra $P_n=E(x_1,\ldots,x_n)\otimes \mathbb F_p(y_1,\ldots,y_n)$ in the…

We study the arithmetic circuit complexity of threshold secret sharing schemes by characterizing the graph-theoretic properties of arithmetic circuits that compute the shares. Using information inequalities, we prove that any unrestricted…

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…