Related papers: Distortion maps for elliptic curves over finite fi…
Distortion maps allow one to solve the Decision Diffie-Hellman problem on subgroups of points on the elliptic curve. In the case of ordinary elliptic curves over finite fields, it is known that in most cases there are no distortion maps. In…
The decision-Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for…
For an elliptic curve $E$ over any field $K$, the Weil pairing $e_n$ is a bilinear map on $n$-torsion. For $K$ of characteristic $p>0$, the map $e_n$ is degenerate if and only if $n$ is divisible by $p$. In this paper, we consider $E$ over…
We give an elementary and self-contained introduction to pairings on elliptic curves over finite fields. For the first time in the literature, the three different definitions of the Weil pairing are stated correctly and proved to be…
Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…
The Discrete Logarithm Problem (DLP) for elliptic curves has been extensively studied since, for instance, it is the core of the security of cryptosystems like Elliptic Curve Cryptography (ECC). In this paper, we present an attack to the…
It has recently been shown that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop a method for constructing such maps on the Weil descent (restriction) of abelian varieties…
We define and study the Weil pairing on the moduli of twisted curves. If $X$ is a twisted curve, then we can combinatorially describe a certain subgroup and a quotient group of $\text{Pic}(X)[2]$ that are Weil dual. Moreover, the pairing…
We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to…
A new approach to discretization of the Duffing equation is presented. Integrable discrete maps are obtained by using well-studied encrypting operations in elliptic curve cryptography and, therefore, they do not depend upon standard small…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for…
The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. To solve this, we propose a variant algorithm of a known method by Brezing and Weng. We produce new families of parameters using…
This article is a short introduction to the theory of the groups of points of elliptic curves over finite fields. It is concerned with the elementary theory and practice of elliptic curves cryptography, the new generation of public key…
The development of secure cryptographic protocols and the subsequent attack mechanisms have been placed in the literature with the utmost curiosity. While sophisticated quantum attacks bring a concern to the classical cryptographic…
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…
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…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
In 1986 Victor Miller described an algorithm for computing the Weil pairing in his unpublished manuscript. This algorithm has then become the core of all pairing-based cryptosystems. Many improvements of the algorithm have been presented.…
We show how the Weil pairing can be used to evaluate the assigned characters of an imaginary quadratic order $\mathcal{O}$ in an unknown ideal class $[\mathfrak{a}] \in \mathrm{Cl}(\mathcal{O})$ that connects two given…