Related papers: A new method for solving the elliptic curve discre…
It is shown that the computational efficiency of the discrete least-squares (DLS) approximation of solutions of stochastic elliptic PDEs is improved by incorporating a reduced-basis method into the DLS framework. The goal is to recover the…
We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…
We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can…
Numerical studies of the dynamics of gravitational systems, e.g., black hole-neutron star systems, require physical and constraint-satisfying initial data. In this article, we present the newly developed pseudo-spectral code Elliptica, an…
We consider some problems of analytic number theory for elliptic curves which can be considered as analogues of classical questions around the distribution of primes in arithmetic progressions to large moduli, and of the question of twin…
We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and…
Implementing the group arithmetic is a cost-critical task when designing quantum circuits for Shor's algorithm to solve the discrete logarithm problem. We introduce a tool for the automatic generation of addition circuits for ordinary…
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…
The purpose of this paper is to propose methods for verifying the positivity of a weak solution $ u $ of an elliptic problem assuming $ H^1_0 $-error estimation $ \left\|u-\hat{u}\right\|_{H_{0}^{1}} \leq \rho $ given some numerical…
Using lower bounds for linear forms in elliptic logarithms we determine the integral points of the modular curve associated to the normalizer of a non-split Cartan group of level 11. As an application we obtain a new solution of the class…
Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its…
In this paper, a new iterative two-level algorithm is presented for solving the finite element discretization for nonsymmetric or indefinite elliptic problems. The iterative two-level algorithm uses the same coarse space as the traditional…
A linear implicit finite difference method is proposed for the approximation of the solution to a periodic, initial value problem for a Schrodinger-Hirota equation. Optimal, second order convergence in the discrete $H^1-$norm is proved,…
We present additive Schwarz preconditioners for a class of elliptic optimal control problems discretized by a partition of unity method. The discrete problem is solved by a primal-dual active set algorithm, where the auxiliary system in…
Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized…
This paper is devoted to the study of a class of singular perturbation elliptic type problems on compact Lie groups or homogeneous spaces $\mathcal{M}$. By constructing a suitable Nash-Moser-type iteration scheme on compact Lie groups and…
If an elliptic differential operator associated with an $\mathbf{H}(\mathrm{curl})$-problem involves rough (rapidly varying) coefficients, then solutions to the corresponding $\mathbf{H}(\mathrm{curl})$-problem admit typically very low…
We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To…