Related papers: Global duality, signature calculus and the discret…

In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a…

This paper is concerned with the homogenization of Dirichlet problem of elliptic systems in a bounded, smooth domain of finite type. Both the coefficients of the elliptic operator and the Dirichlet boundary data are assumed to be periodic…

In this paper, we use probabilistic approach to prove that there exists a unique weak solution to the Dirichlet boundary value problem for second order elliptic equations whose coefficients are signed measures, and we will give a…

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

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.…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

In this paper, we adapt the differential signature construction to the equivalence problem for complex plane algebraic curves under the actions of the projective group and its subgroups. Given an action of a group $G$, a signature map…

We study a Dirichlet problem for an elliptic equation defined by a degenerate coercive operator and a singular right-hand side. We will show that the right-hand side has some regularizing effects on the solutions, even if it is singular.

The elliptic curve discrete logarithm problem is of fundamental importance in public-key cryptography. It is in use for a long time. Moreover, it is an interesting challenge in computational mathematics. Its solution is supposed to provide…

In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for…

We apply numerical algebraic geometry to the invariant-theoretic problem of detecting symmetries between two plane algebraic curves. We describe an efficient equality test which determines, with "probability-one", whether or not two…

We present an index calculus algorithm with double large prime variation which lends itself well to a rigorous analysis. Using this algorithm we prove that for fixed genus $g \geq 2$, the discrete logarithm problem in degree 0 class groups…

Solving the discrete logarithm problem in a finite prime field is an extremely important computing problem in modern cryptography. The hardness of solving the discrete logarithm problem in a finite prime field is the security foundation of…

We introduce and study the Dirichlet problem for double divergence form elliptic equations with coefficients of low regularity and boundary conditions given by general Borel measures. Under broad assumptions we establish the solvability of…

We show continuity in generalized weighted Morrey spaces of sub-linear integral operators generated by some classical integral operators and commutators. The obtained estimates are used to study global regularity of the solution of the…

In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DLP) into a system of equations. These…

Considering the difficult problem under classical computing model can be solved by the quantum algorithm in polynomial time, t-multiple discrete logarithm problems presented. The problem is non-degeneracy and unique solution. We talk about…

The aim of this paper is to justify the common cryptographic practice of selecting elliptic curves using their order as the primary criterion. We can formalize this issue by asking whether the discrete log problem (DLOG) has the same…

In this paper we study a Dirichlet problem for an elliptic equation with degenerate coercivity and a singular lower order term with natural growth with respect to the gradient. We will show that, even if the lower order term is singular, it…