d11a8f6d-8475-4b0c-9e61-9363b4b9bd1420210218094945189wseamdt@crossref.orgMDT DepositWSEAS TRANSACTIONS ON MATHEMATICS1109-276910.37394/23206http://wseas.org/wseas/cms.action?id=40512720202720201910.37394/23206.2020.19http://wseas.org/wseas/cms.action?id=23185The Order of Edwards and Montgomery CurvesRuslanSkuratovskiiDepartment of Computer Science, UniversityIgor Sikorsky Kiev Polytechnic Institute, National Technical University of Ukraine, UKRAINEVolodymyrOsadchyyceo IT-GRAVITY-VO, Inc., Orlando, Florida, Edgewater Sr, Suite 1888, Orlando, FL, 32804, USAThe Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA) [2]. It is well known that the problem of discrete logarithm is NP-hard on group on elliptic curve (EC) [5]. The orders of groups of an algebraic affine and projective curves of Edwards [3, 9] over the finite field Fpn is studied by us. We research Edwards algebraic curves over a finite field, which are one of the most promising supports of sets of points which are used for fast group operations [1]. We construct a new method for counting the order of an Edwards curve [F ] d p E over a finite field Fp . It should be noted that this method can be applied to the order of elliptic curves due to the birational equivalence between elliptic curves and Edwards curves. The method we have proposed has much less complexity 22 O p log p at not large values p in comparison with the best Schoof basic algorithm with complexity 8 2 O(log pn ) , as well as a variant of the Schoof algorithm that uses fast arithmetic, which has complexity 42O(log pn ) , but works only for Elkis or Atkin primes. We not only find a specific set of coefficients with corresponding field characteristics for which these curves are supersingular, but we additionally find a general formula by which one can determine whether a curve [F ] d p E is supersingular over this field or not. The symmetric of the Edwards curve form and the parity of all degrees made it possible to represent the shape curves and apply the method of calculating the residual coincidences. A birational isomorphism between the Montgomery curve and the Edwards curve is also constructed. A oneto- one correspondence between the Edwards supersingular curves and Montgomery supersingular curves is established. The criterion of supersingularity for Edwards curves is found over F pn .562020562020253264https://www.wseas.org/multimedia/journals/mathematics/2020/a505106-1195.pdf10.37394/23206.2020.19.25http://www.wseas.org/multimedia/journals/mathematics/2020/a505106-1195.pdf10.1007/978-3-540-68164-9_26Daniel J. Bernstein, Peter Birkner, Marc Joy e, Tanja Lange, and Christiane Peters. Twisted edwards curves. Progress in Cryptology -- AFRICACRYPT 2008 (6,5); (6,8);(7,5);, pp. 389-405, Berlin, Heidelberg, 2008.10.1007/s102070100002Don Johnson, Alfred Menezes, Scott Vanstone. The Elliptic Curve Digital Signature Algorithm. International Journal of Information Security volume 1, Springer, 2014, pp. 36–63. 10.1090/s0273-0979-07-01153-6Harold Edwards. A normal form for elliptic curves. Bulletin of the American mathematical society, 44 (3): 393-422, 2007. William Fulton. Algebraic curves. An Introduction to Algebraic Geometry. Addison-Wesley, 3 edition, 2008.L. 10.1090/s0025-5718-1987-0866109-5Neal Koblitz. Elliptic curve cryptosys tems. Mathematics of computation, 48 (177): 203-209, 1987. 10.1017/cbo9781139172769Rudolf Lidl and Harald Niederreiter. Introduction to Finite Fields and t heir Applications. Cambridge university press, 1994. 10.1090/s0025-5718-1987-0866113-7Peter L Montgomery. Speeding the pollard and elliptic curve methods of factorization.Mathematics of computation, 48 (177): 243-264, 1987.10.5802/jtnb.142René Schoof. Counting points on elliptic curves over finite fields. Journal de théorie des nombres de Bordeaux, 7(1): 219-254, 1995. Ruslan Viacheslavovich Skuratovskii. The order of projective edwards curve over and embedding degree of this curve in finite field. In Cait 2018, pp. 75-80, 2018. Ruslan Viacheslavovich Skuratovskii. Supersingularity of elliptic curves. Research in Mathematics and Mechanics, 31(1):17-26, 2018. 10.1007/978-981-13-0341-8_32Ruslan Viacheslavovich Skuratovskii. Employment of minimal generating sets and structure of sy low 2-subgroups alternating groups in block ciphers. In Advances in Computer Communication and Computational Sciences, pages 351-364. Springer, 2019. Serge Aleksandrovich Stepanov. Arifmetika algebraicheskikh krivykh (in Russian). Nauka,Glav. red. fiziko-matematichesko lit-ry, 1991. Ivan Matveevich Vinogradov. Elements of number theory. Courier Dover Publications, 2016. 10.1007/11693383_22Paulo S. L. M. Barreto and Michael Naehrig. Pairing-friendly elliptic curves of prime order. Springer, Selected Areas in Cryptography, pages 319-331, Berlin, Heidelberg, 2006. N. M. Glazunov, Skobelev S.P. Manifolds over the rings. IAMM National Academy of Sciences of Ukraine, Donetsk, 2011. 323 p. 10.1016/0022-314x(89)90003-6P. D Varbanec, P. Zarzycki. Divisors of the Gaussian integers in an arithmetic progression. Journal of Number Theory. Volume 33, Issue 2, October 1989, Pages 152-169. Silverman, Joseph, H.; The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, 106, Springer-Verlag, 1986. R. V. Skuratovskii, Aled William s (2019) "A solution of the inverse problem to doubling of twisted Edwards curve point over finite field", Processing, transmission and security of information - 2019 vol. 2. 10.1007/bf02684373Deligne, Pierre. La conjecture de Weil, Publications Mathematiques de l’IHES. 1974. Vol. 43. pp. 273-307.IEEE 10.1007/978-981-13-0341-8_32R. V. Skuratovskii, Employment of Minimal Generating Sets and Structure of S ylow 2-Subgroups Alternating Groups in BlockCiphers. Springer, Advances in Computer Communication and Computational Sciences, 2019, pp. 351-364. 10.3390/math8040472R. Skuratovskii, The Derived Subgroups of Sylow 2-Subgroups of the Alternating Group and Commutator Width of Wreath Product of Groups. Mathematics, Basel, Switzerland, (2020)No 8(4), pp. 1-19. Craig Costello, Benjam in Smith Montgomery curves and their arithmetic. Journal of Cryptographic Engineering volume 8 no.3, pp. 227–240 (2018). 10.1016/j.jnt.2016.05.004Andrea Bandini, Laur a Paladino. Fields generated by torsion points of elliptic curves 2016 Journal of Number Theory 169: pp. 10 3-133.Daniele di Tullio, Manoj Gyawali. Elliptic curves of nearly prime order. pp. 1-19. [Source: iacr.org], access mode: https://eprint.iacr.org/2020/001.pdf 10.1007/978-3-030-03332-3_16Craig Costello. Com puting Supersingular Isogenies on Kummer Surfaces. Springer. Advances in Cryptology 24 International conference in Theory Cryptography, Part 3.– ASIACRYPT 2018. pp. 428-440.