Compression on the Twisted Jacobi Intersection

• Autorzy: Dryło Robert

Identyfikatory

DOI

10.3233/FI-2021-2060

• Języki publikacji: EN

Abstrakty

EN

Formulas for doubling, differential addition and point recovery after compression were given for many standard models of elliptic curves, and allow for scalar multiplication after compression using the Montgomery ladder algorithm and point recovery on a curve after this multiplication. In this paper we give such formulas for the twisted Jacobi intersection au² + v² = 1, bu² + w² = 1. To our knowledge such formulas were not given for this model or for the Jacobi intersection. In projective coordinates these formulas have cost 2M + 2S + 6D for doubling and 5M + 2S + 6D for differential addition, where M, S, D are multiplication, squaring and multiplication by constants in a field, respectively, choosing suitable curve parameters cost of D may be small.

Słowa kluczowe

EN

elliptic curve cryptography; point compression on elliptic curves; Montgomery ladder algorithm; twisted Jacobi intersection

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2021
• Tom: Vol. 181, nr 4
• Strony: 303--312
• Opis fizyczny: Bibliogr. 15 poz., rys.

Twórcy

autor

Dryło Robert

• Warsaw School of Economics, Aleja Niepodległości 162, 02-554 Warsaw, Poland

Bibliografia

• [1] Adams WW, Loustaunau P. An introduction to Gröbner bases (No. 3). American Mathematical Soc. (1994).
• [2] Atkin AOL, Morain F. Elliptic curves and primality proving. Mathematics of computation, 1993. 61(203):29-68. doi:10.2307/2152935.
• [3] Brier E, Joye M. Weierstraß elliptic curves and side-channel attacks. In D. Naccache and P. Paillier, editors, Public Key Cryptography, number 2274 in Lecture Notes in Computer Science, pages 183-194, Berlin, Heidelberg, 2002. Springer-Verlag. doi:10.1007/3-540-45664-3_24.
• [4] Castryck W, Vercauteren F. Toric forms of elliptic curves and their arithmetic. Journal of Symbolic Computation, Elsevier 2011. 46(8):943-966. doi:10.1016/j.jsc.2011.02.003.
• [5] Cox D, Little J, O’shea D. Ideals, varieties, and algorithms (Vol. 3). New York: Springer 1992. doi:10.1007/978-1-4757-2181-2.
• [6] Dryło R, Kijko T, Wroński M. Determining Formulas Related to Point Compression on Alternative Models of Elliptic Curves. Fundamenta Informaticae, 2019. 169(4):285-294. doi:10.3233/FI-2019-1848.
• [7] Dryło R, Kijko T, Wroński MJ. Arithmetic using compression on elliptic curves in Huff’s form and its applications. International Journal of Electronics and Telecommunications 2021. 67(2):193-200. doi:10.24425/ijet.2021.135964.
• [8] Farashahi R, Joye M. Efficient arithmetic on Hessian curves. In International Workshop on Public Key Cryptography. Springer, Berlin, Heidelberg 2010 pp. 243-260. doi:10.1007/978-3-642-13013-7_15.
• [9] Feng R, Nie M, Wu H. Twisted Jacobi intersections curves. Theoretical Computer Science, 2013. 494:24-35. doi:10.1016/j.tcs.2012.12.027.
• [10] Justus B, Loebenberger D. Differential addition in generalized Edwards coordinates. In International Workshop on Security. Springer, Berlin, Heidelberg 2010 pp. 316-325. doi:10.1007/978-3-642-16825-3_21.
• [11] Lenstra Jr, HW. Factoring integers with elliptic curves. Annals of mathematics, 1987:649-673.
• [12] Liardet PY, Smart NP. Preventing SPA/DPA in ECC systems using the Jacobi form. In International Workshop on Cryptographic Hardware and Embedded Systems. Springer, Berlin, Heidelberg 2001 pp. 391-401. doi:10.1007/3-540-44709-1_32.
• [13] Montgomery P. Speeding the Pollard and elliptic curve methods of factorization. In: Mathematics of Computation, 1987. 48(177):243-264.
• [14] Okeya K, Sakurai K. Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve. In International Workshop on Cryptographic Hardware and Embedded Systems. Springer, Berlin, Heidelberg 2001 pp. 126-141. doi:10.1007/3-540-44709-1_12.
• [15] da Silva JP, López J, Dahab R. Isogeny formulas for Jacobi intersection and twisted hessian curves. Advances in Mathematics of Communications, 202014(3):507-523. doi:10.3934/amc.2020048.