相关论文: The Discrete Logarithm Problem in Bergman's non-re…

Let $\E$ be a commutative ring with identity and $P\in\E[x]$ be a polynomial. In the present paper we consider digit representations in the residue class ring $\E[x]/(P)$. In particular, we are interested in the question whether each…

The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of…

We determine the mod-p cohomology rings of an infinite family of p-groups, for odd primes p, with cyclic derived subgroups. Our method involves embedding the groups in a compact Lie group of dimension one, and was suggested by P. H.…

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Biggs proposed the sandpile group of certain modified wheel graphs for cryptosystems relying on the difficulty of the discrete logarithm problem. Blackburn and independently Shokrieh showed that the discrete logarithm problem is efficiently…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

A numerical algorithm is proposed to deal with parametric eigenvalue problems involving non-Hermitian matrices and is exploited to find location of defective eigenvalues in the parameter space of non-Hermitian parametric eigenvalue…

In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…

Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a quantum algorithm of Arvind et al.…

We introduce the class E2 (resp. SE2) of commutative rings R with the property that each unimodular 2 x 2 matrix with entries in R extends to an invertible 3 x 3 matrix (resp. invertible 3 x 3 matrix whose (3, 3) entry is 0). Among…

In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_q$, for p and q prime. We first present a classification of these groups in five classes. Then, we…

The Learning with Errors (LWE) problem is the fundamental backbone of modern lattice based cryptography, allowing one to establish cryptography on the hardness of well-studied computational problems. However, schemes based on LWE are often…

The square root modulo problem is a known primitive in designing an asymmetric cryptosystem. It was first attempted by Rabin. Decryption failure of the Rabin cryptosystem caused by the 4-to-1 decryption output is overcome efficiently in…

A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…

Let $P$ be a path graph of $n$ vertices embedded in a metric space. We consider the problem of adding a new edge to $P$ so that the radius of the resulting graph is minimized, where any center is constrained to be one of the vertices of…

In this paper, we mainly give characterizations of EP elements in terms of equations. In addition, a related notion named a central EP element is defined and investigated. Finally, we focus on characterizations of a generalized EP element,…

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

The ring and polynomial learning with errors problems (Ring-LWE and Poly-LWE) have been proposed as hard problems to form the basis for cryptosystems, and various security reductions to hard lattice problems have been presented. So far…

Given an elliptic curve $E$ defined over the rational numbers and a prime $p$ at which $E$ has good reduction, we consider the Galois deformation ring parametrizing lifts of the residual representation on the $p$-torsion group $E[p]$. For a…

We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…