相关论文: More constructing pairing-friendly elliptic curves…
In this study, we introduce a new approach to curve pairs by using integral curves. We consider the direction curve and donor curve to study curve couples such as involute-evolute curves, Mannheim partner curves and Bertrand partner curves.…
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
Major families of pairing-friendly elliptic curves, including BN, BLS12, BLS24, KSS16, and KSS18 have recently been vulnerable to number field sieve (NFS) attacks. Due to the recent attacks on discrete logs in F_(q^k ), selecting such…
Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational…
Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances are built over finite fields of large characteristic and…
While there has been considerable interest in the problem of finding elliptic curves of high rank over $\mathbb{Q}$, very few parametrized families of elliptic curves of generic rank $\geq 8$ have been published. In this paper we use…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
We introduce a new tool for the study of isogeny-based cryptography, namely pairings which are sesquilinear (conjugate linear) with respect to the $\mathcal{O}$-module structure of an elliptic curve with CM by an imaginary quadratic order…
Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…
We construct pairs of elliptic curves over number fields with large intersection of projective torsion points.
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…
Pairing is the most powerful tool in cryptography that maps two points on the elliptic curve to the group over the finite field. Mostly cryptographers consider pairing as a black box and use it for implementing pairing-based cryptographic…
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…
An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.
We present the first BLS12-381 elliptic curve pairing crypto-processor for Internet-of-Things (IoT) security applications. Efficient finite field arithmetic and algorithm-architecture co-optimizations together enable two orders of magnitude…
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…
Let $k=2^mp^n$ for an odd prime $p$ and integers $m\ge 0$ and $n\ge 0$. We obtain lower bounds for the $\rho$-values of cyclotomic families of pairing-friendly elliptic curves with embedding degree $k$ and $r(x)=\Phi_k(x)$. Our bounds imply…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…
Efficient computations of pairings with Miller Algorithm have recently received a great attention due to the many applications in cryptography. In this work, we give formulae for the optimal Ate pairing in terms of elliptic nets associated…