Abstract
This paper is devoted to increasing of performance of digital signature algorithms based on elliptic curves over binary fields. Group operations complexity on Edwards curves are less than on Weierstrass curves and have immunity to some side channel attacks. Hence, it is interesting to search birationally equivalent curves in Edwards form for curves in Weierstrass form presented in NIST recommended curves list. It allows using operations over points on Edwards curve in intermediate computations in scalar multiplications over curves in Weierstrass form. This approach improves the performance and security of digital signature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
IEEE working group: IEEE 1363-2000: Standard Specifications For Public Key Cryptography. IEEE standard. IEEE, New York, NY 10017 (2000). http://grouper.ieee.org/groups/1363/P1363/
ISO/IEC. ISO/IEC 14888-3:2006, Information technology – Security techniques – Digital signatures with appendix – Part 3: Discrete logarithm based mechanisms (2006)
Bernstein D.J., Lange T.: Failures in NIST’s ECC standards (2016). https://cr.yp.to/newelliptic/nistecc-20160106.pdf
Kovtun, V., Tevyashev, A., Zbitnev, S.: Algorithms of scalar multiplication in group of elliptic curve points and some of their modifications. Radiotekhnika 141, 82–96 (2005). (in Russian)
Bernstein, D.J., Lange, T.: Analysis and optimization of elliptic-curve single-scalar multiplication. In: Gary, L., Mullen, D. (eds.) Finite Fields and Applications, Contemporary Mathematics, vol. 461, pp. 1–19. American Mathematical Society (2008)
Moloney, R., O’Mahony, A., Laurent, P.: Efficient implementation of elliptic curve point operations using binary Edwards curves. IACR Cryptology ePrint Archive, Report 2010/208 (2010). http://eprint.iacr.org/2010/208.pdf
Kwang, H., Chol, O., Christophe, N.: Binary Edwards curves revisited. In: INDOCRYPT 2014. LNCS, vol. 8885, pp. 393–408 (2014)
Bernstein, D.J., Lange, T., Rezaeian Farashahi, R.: Binary Edwards curves. In: Oswald, E., Rohatgi, P. (eds.) Cryptographic Hardware and Embedded Systems – CHES 2008. LNCS, vol. 5154, pp. 244–265. Springer, Heidelberg (2008)
Bernstein, D.J.: Batch binary Edwards. In: Halevi, S. (eds.) Advances in Cryptology - CRYPTO 2009. LNCS, vol. 5677, pp. 317–336. Springer, Heidelberg (2009)
Ming, L., Ali, M., Daming, Z.: Fast algorithm for converting ordinary elliptic curves into binary Edward Form. Int. J. Dig. Content Technol. Appl. 6(1), 405–412 (2012)
Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (eds.) Progress in Cryptology – AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389–405. Springer, Heidelberg (2008)
Bernstein, D.J., Lange, T.: Inverted Edwards coordinates. In: Boztaş, S., Lu, H.F. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 2007. LNCS, vol. 4851, pp. 20–27. Springer, Heidelberg (2007)
Kovtun, M., Gnatyuk, S., Trofimenko, V.: Accelerated r-th root extraction in binary field. In: 2nd International Scientific Conference: Information and Telecommunication Technologies: Education, Science and Practice, pp. 547–551. Almaty (2015). (in Russian)
Digital signature standard (DSS). Federal Information Processing Standard 186-4. National Institute of Standards and Technology (2015)
Barreto, P.S.L.M., Voloch, J.F.: Efficient computation of roots in finite fields. Des. Codes Crypt. 39, 275–280. https://doi.org/10.1007/s10623-005-4017-5
Bluhm, M.: Software optimization of binary elliptic curves arithmetic using modern processor architectures, Ph.D. RUHR-Universitat Bochum (2013)
Hu, Z., Gnatyuk, S., Koval, O., Gnatyuk, V., Bondarovets, S.: Anomaly detection system in secure cloud computing environment. Int. J. Comput. Netw. Inf. Secur. (IJCNIS) 9(4), 10–21 (2017). https://doi.org/10.5815/ijcnis.2017.04.02
Gnatyuk, S., Okhrimenko, A., Kovtun, M., Gancarczyk, T., Karpinskyi, V.: Method of algorithm building for modular reducing by irreducible polynomial. In: 16th International Conference on Control, Automation and Systems. Gyeongju, Korea, pp. 1476–1479 (2016)
Explicit-Formulas Database. http://www.hyperelliptic.org/EFD
Acknowledgment
This scientific work was financially supported by self-determined research funds of CCNU from the colleges’ basic research and operation of MOE (CCNU16A02015).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Hu, Z., Gnatyuk, S., Kovtun, M., Seilova, N. (2019). Method of Searching Birationally Equivalent Edwards Curves Over Binary Fields. In: Hu, Z., Petoukhov, S., Dychka, I., He, M. (eds) Advances in Computer Science for Engineering and Education. ICCSEEA 2018. Advances in Intelligent Systems and Computing, vol 754. Springer, Cham. https://doi.org/10.1007/978-3-319-91008-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-91008-6_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91007-9
Online ISBN: 978-3-319-91008-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)