Optimized Method for Computing Odd-Degree Isogenies on Edwards Curves

Author(s):  
Suhri Kim ◽  
Kisoon Yoon ◽  
Young-Ho Park ◽  
Seokhie Hong
Keyword(s):  
Cryptography ◽  
2020 ◽  
Vol 4 (3) ◽  
pp. 20 ◽  
Author(s):  
Donghoe Heo ◽  
Suhri Kim ◽  
Kisoon Yoon ◽  
Young-Ho Park ◽  
Seokhie Hong

The implementation of isogeny-based cryptography mainly use Montgomery curves, as they offer fast elliptic curve arithmetic and isogeny computation. However, although Montgomery curves have efficient 3- and 4-isogeny formula, it becomes inefficient when recovering the coefficient of the image curve for large degree isogenies. Because the Commutative Supersingular Isogeny Diffie-Hellman (CSIDH) requires odd-degree isogenies up to at least 587, this inefficiency is the main bottleneck of using a Montgomery curve for CSIDH. In this paper, we present a new optimization method for faster CSIDH protocols entirely on Montgomery curves. To this end, we present a new parameter for CSIDH, in which the three rational two-torsion points exist. By using the proposed parameters, the CSIDH moves around the surface. The curve coefficient of the image curve can be recovered by a two-torsion point. We also proved that the CSIDH while using the proposed parameter guarantees a free and transitive group action. Additionally, we present the implementation result using our method. We demonstrated that our method is 6.4% faster than the original CSIDH. Our works show that quite higher performance of CSIDH is achieved while only using Montgomery curves.


2020 ◽  
Vol 36 (3) ◽  
pp. 469-490
Author(s):  
Yoshihiro Asayama ◽  
Ryo Matsukawa ◽  
Naoki Matsumoto ◽  
Atsuhiro Nakamoto
Keyword(s):  

2006 ◽  
Vol 34 (2) ◽  
pp. 625-632 ◽  
Author(s):  
P. B. Barquero-Salavert
Keyword(s):  

1985 ◽  
Vol s2-31 (2) ◽  
pp. 250-264 ◽  
Author(s):  
Martin W. Liebeck ◽  
Jan Saxl

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Hongfeng Wu ◽  
Liangze Li ◽  
Fan Zhang

We propose an elaborate geometry approach to explain the group law on twisted Edwards curves which are seen as the intersection of quadric surfaces in place. Using the geometric interpretation of the group law, we obtain the Miller function for Tate pairing computation on twisted Edwards curves. Then we present the explicit formulae for pairing computation on twisted Edwards curves. Our formulae for the doubling step are a little faster than that proposed by Arène et al. Finally, to improve the efficiency of pairing computation, we present twists of degrees 4 and 6 on twisted Edwards curves.


1988 ◽  
Vol 44 (6) ◽  
pp. 958-962
Author(s):  
Yu. N. Subbotin
Keyword(s):  

1978 ◽  
Vol 43 (1) ◽  
pp. 82-91 ◽  
Author(s):  
Michael F. Singer

In this paper, we show that the theory of ordered differential fields has a model completion. We also show that any real differential field, finitely generated over the rational numbers, is isomorphic to some field of real meromorphic functions. In the last section of this paper, we combine these two results and discuss the problem of deciding if a system of differential equations has real analytic solutions. The author wishes to thank G. Stengle for some stimulating and helpful conversations and for drawing our attention to fields of real meromorphic functions.§ 1. Real and ordered fields. A real field is a field in which −1 is not a sum of squares. An ordered field is a field F together with a binary relation < which totally orders F and satisfies the two properties: (1) If 0 < x and 0 < y then 0 < xy. (2) If x < y then, for all z in F, x + z < y + z. An element x of an ordered field is positive if x > 0. One can see that the square of any element is positive and that the sum of positive elements is positive. Since −1 is not positive, an ordered field is a real field. Conversely, given a real field F, it is known that one can define an ordering (not necessarily uniquely) on F [2, p. 274]. An ordered field F is a real closed field if: (1) every positive element is a square, and (2) every polynomial of odd degree with coefficients in F has a root in F. For example, the real numbers form a real closed field. Every ordered field can be embedded in a real closed field. It is also known that, in a real closed field K, polynomials satisfy the intermediate value property, i.e. if f(x) ∈ K[x] and a, b ∈ K, a < b, and f(a)f(b) < 0 then there is a c in K such that f(c) = 0.


2018 ◽  
Vol 15 (11) ◽  
pp. 1850190 ◽  
Author(s):  
Viktor Abramov

We propose an extension of [Formula: see text]-ary Nambu–Poisson bracket to superspace [Formula: see text] and construct by means of superdeterminant a family of Nambu–Poisson algebras of even degree functions, where the parameter of this family is an invertible transformation of Grassmann coordinates in superspace [Formula: see text]. We prove in the case of the superspaces [Formula: see text] and [Formula: see text] that our [Formula: see text]-ary bracket, defined with the help of superdeterminant, satisfies the conditions for [Formula: see text]-ary Nambu–Poisson bracket, i.e. it is totally skew-symmetric and it satisfies the Leibniz rule and the Filippov–Jacobi identity (fundamental identity). We study the structure of [Formula: see text]-ary bracket defined with the help of superdeterminant in the case of superspace [Formula: see text] and show that it is the sum of usual [Formula: see text]-ary Nambu–Poisson bracket and a new [Formula: see text]-ary bracket, which we call [Formula: see text]-bracket, where [Formula: see text] is the product of two odd degree smooth functions.


Sign in / Sign up

Export Citation Format

Share Document