Counting points on twisted Edwards curves over finite fields

Authors

  • Võ Tùng Linh
  • Phó Đức Tài

DOI:

https://doi.org/10.54654/isj.v1i16.912

Keywords:

counting points, twisted Edwards curve, Montgomery curve, Weierstrass curve, elliptic curve

Tóm tắt

Abstract In this paper, we are interested in counting points on a twisted Edwards curve defined over a finite field. In particular, we construct explicit formulae allowing to determine exactly the number of k-rational points on a twisted Edwards curve when the number of k-rational points on the birational equivalent curve of Weierstrass or Montgomery form respectively is known. Using these formulae, we introduce an algorithm to count points on the twisted Edwards curve define over a finite field.

Downloads

Download data is not yet available.

References

. FIPS 186-5. Digital signature standard (dss). Technical report, 2021.

. Marta Bellés-Munoz, Barry Whitehat, ˜ Jordi Baylina, Vanesa Daza, and Jose Luis Munoz-Tapia. Twisted edwards elliptic curves for zero-knowledge circuits. Mathematics, 9(23):3022, 2021.

. Daniel J Bernstein, Peter Birkner, Marc Joye, Tanja Lange, and Christiane Peters. Twisted edwards curves. In International Conference on Cryptology in Africa, pages 389–405. Springer, 2008.

. Daniel J Bernstein, Peter Birkner, Tanja Lange, and Christiane Peters. Optimizing double-base elliptic-curve single-scalar multiplication. In International Conference on Cryptology in India, pages 167–182. Springer, 2007.

. Daniel J Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang. High-speed high-security signatures. Journal of cryptographic engineering, 2(2):77–89, 2012.

. Daniel J Bernstein and Tanja Lange. Faster addition and doubling on elliptic curves. In international conference on the theory and application of cryptology and information security, pages 29–50. Springer, 2007.

. Ian Blake, Gerald Seroussi, Gadiel Seroussi, and Nigel Smart. Elliptic curves in cryptography, volume 265. Cambridge

university press, 1999.

. Harold Edwards. A normal form for elliptic curves. Bulletin of the American mathematical society, 44(3):393–422,

. Huseyin Hisil, Kenneth Wong, Gary Carter, and Ed Dawson. Faster group operations on elliptic curves. In Information Security 2009: proceedings of the 7th Australasian Information Security Conference, pages 7–19. Australian Computer Society, 2009.

. Simon Josefsson and Ilari Liusvaara. Edwards-curve digital signature algorithm (eddsa). Technical report, 2017.

. Adam Langley, Mike Hamburg, and Sean Turner. Elliptic curves for security.

Technical report, 2016.

. Christiane Peters. Curves, Codes, and Cryptography. PhD thesis, PhD thesis, Technische Universiteit Eindhoven, 2011.

. René Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Mathematics of computation,

(170):483–494, 1985.

. René Schoof. Counting points on elliptic curves over finite fields. Journal de théorie des nombres de Bordeaux, 7(1):219–254, 1995.

Downloads

Abstract views: 342 / PDF downloads: 81

Published

2023-02-10

How to Cite

Linh, V. T., & Tài, P. Đức. (2023). Counting points on twisted Edwards curves over finite fields. Journal of Science and Technology on Information Security, 2(16), 3-13. https://doi.org/10.54654/isj.v1i16.912

Issue

Section

Papers