Related papers: Pairings on Generalized Huff Curves
This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric…
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…
Recently, Edwards curves have received a lot of attention in the cryptographic community due to their fast scalar multiplication algorithms. Then, many works on the application of these curves to pairing-based cryptography have been…
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 present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
We introduce and study a class of Hopf algebras $H(G, \chi, \eta, b, c, \beta)$ which are two-step Ore extensions of a group algebra $\mathbb{K}[G]$. This construction unifies and generalizes some known families of Hopf algebras such as…
Fisher and Newton have given an explicit description of the Tate local pairing associated with the 3-torsion of an elliptic curve. The present paper summarizes the work from the author's master's thesis and gives an explicit formula for any…
Much attention has been given to the efficient computation of pairings on elliptic curves with even embedding degree since the advent of pairing-based cryptography. The few existing works in the case of odd embedding degrees require some…
Miyaji, Nakabayashi, and Takano proposed the algorithm for the construction of prime order pairing-friendly elliptic curves with embedding degrees $k=3,4,6$. We present a method for generating generalized MNT curves. The order of such…
A Huff curve over a field $K$ is an elliptic curve defined by the equation $ax(y^2-1)=by(x^2-1)$ where $a,b\in K$ are such that $a^2\ne b^2$. In a similar fashion, a general Huff curve over $K$ is described by the equation…
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…
We extend the method of Cassels for computing the Cassels-Tate pairing on the 2-Selmer group of an elliptic curve, to the case of 3-Selmer groups. This requires significant modifications to both the local and global parts of the…
We introduce the twisted $\boldsymbol{\mu}_4$-normal form for elliptic curves, deriving in particular addition algorithms with complexity $9\mathbf{M} + 2\mathbf{S}$ and doubling algorithms with complexity $2\mathbf{M} + 5\mathbf{S} +…
A class of finite-dimensional Hopf algebras which generalise the notion of Taft algebras is studied. We give necessary and sufficient conditions for these Hopf algebras to omit a pair in involution, that is, to not have a group-like and a…
We define and investigate pairings of multiplier Hopf algebras. It is shown that two dually paired regular multiplier Hopf ($*$-)algebras $A$ and $B$ yield a quantum double multiplier Hopf ($*$-)algebra which is again regular. Integrals on…
This study reports on an implementation of cryptographic pairings in a general purpose computer algebra system. For security levels equivalent to the different AES flavours, we exhibit suitable curves in parametric families and show that…
Let $E$ be an elliptic curve with complex multiplication by a ring $R$, where $R$ is an order in an imaginary quadratic field or quaternion algebra. We define sesquilinear pairings ($R$-linear in one variable and $R$-conjugate linear in the…
Using numerical diagonalization of a 4x4 cluster, we calculate on-site s, extended s and d pairing correlation functions (PCF) in an effective generalized Hubbard model for the cuprates, with nearest-neighbor correlated hopping and next…
Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…