Konstruksi Lapangan Hasil Bagi dari Daerah Integral sebagai Landasan Aljabar Kriptografi Kurva Eliptik

Miftah Sigit Rahmawati; Muhammad Fadli Hasa

doi:10.37905/euler.v14i2.40284

Konstruksi Lapangan Hasil Bagi dari Daerah Integral sebagai Landasan Aljabar Kriptografi Kurva Eliptik

Miftah Sigit Rahmawati, Muhammad Fadli Hasa

Abstract

This article develops a conceptual framework that connects quotient field construction, kurva eliptik curve group structures, and symbolic operations in Elliptic Curve Cryptography (ECC), enabling the mathematical mechanisms of ECC to be analyzed explicitly before being implemented over finite fields. Although practical implementations of ECC employ finite fields as the basis for arithmetic operations, understanding quotient field construction from an integral domain remains important as the mathematical foundation of kurva eliptik curve operations. This article investigates the algebraic structure of the quotient field and its application to kurva eliptik curve theory, focusing on point addition and the verification of the Abelian group properties of the point set . This approach allows every algebraic operation to be represented symbolically (symbolic computation), enabling kurva eliptik curve point operations to be analyzed more explicitly. Such an understanding bridges the concepts of abstract algebra and kurva eliptik curve group structures. Therefore, the study of quotient fields provides a conceptual framework that supports the theoretical understanding of ECC. This article aims to provide a deeper understanding of the mathematical foundations underlying the use of kurva eliptik curves in cryptography as a step toward developing a conceptual framework for explaining ECC.

Keywords

Abelian group; Field; Integral domain; Crypthography, Elliptic curve

Full Text:

PDF

References

S. Gajbhiye, S. Karmakar, and M. Sharma, “Study of finite field over elliptic curve: Arithmetic means,” International Journal of Computer Applications, vol. 47, no. 17, pp. 32–38, 2012, doi:10.5120/7283-0411.

M. A. Mohamed, “A survey on elliptic curve cryptography,” Applied Mathematical Sciences, vol. 8, no. 153–156, pp. 7665–7691, 2014, doi:10.12988/ams.2014.49752.

B. N. Koblitz, “Elliptic curve cryptosystems,” vol. 4, no. 177, pp. 203–209, 1987.

A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.

D. Hankerson, S. Vanstone, and A. Menezes, Guide to Elliptic Curve Cryptography, 1st ed., ser. Springer Professional Computing. Springer New York, NY, 2004, doi:10.1007/b97644.

J. Katz and Y. Lindell, Introduction to Modern Cryptography, 2nd ed. Chapman & Hall/CRC, 2014.

National Institute of Standards and Technology, “Recommendation for discrete logarithm-based cryptography: Elliptic curve domain parameters,” https://csrc.nist.gov/pubs/sp/800/186/final, 2023.

T. W. Hungerford, Algebra, 1st ed., ser. Graduate Texts in Mathematics. Springer New York, NY, 1974, doi:10.1007/978-1-4612-6101-8.

D. S. Dummit and R. M. Foote, Abstract Algebra, 3rd ed. John Wiley & Sons, July 2003.

S. Kim and S. Kim, “Algebraic structure in elliptic curves,” vol. 13, no. 3, pp. 143–152, 2019.

J. H. Silverman, The Arithmetic of Elliptic Curves, 2nd ed., ser. Graduate Texts in Mathematics. Springer, 2009, vol. 106, doi:10.1007/978-0-387-09494-6.

L. C. Washington, Elliptic Curves: Number Theory and Cryptography, 2nd ed., ser. Discrete Mathematics and Its Applications. Chapman & Hall/CRC, April 2008.

D. Maimut and A. C. Matei, “Speeding-up elliptic curve cryptography algorithms,” Mathematics, vol. 10, no. 19, p. 3676, 2022, doi:10.3390/math10193676.

A. M. Awaludin et al., “High-speed and unified ECC processor for generic weierstrass curves over GF(p),” IACR ePrint Archive, 2022.

C. Heuberger et al., “Some notes on a formal algebraic structure of cryptology,” Theoretical Computer Science, vol. 11, no. 1, pp. 1–24, 2021, doi:10.3390/math9182183.

M. F. Atiyah and I. G. Macdonald, Introduction to Commutative Algebra, 1st ed., ser. Addison-Wesley Series in Mathematics. Addison-Wesley, February 1994.

D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, ser. Graduate Texts in Mathematics. Springer, 1995, vol. 150, doi:10.1007/978-1-4612-5350-1.

P. Longa, “Accelerating the scalar multiplication on elliptic curve cryptosystems over prime fields,” Master’s thesis, University of Ottawa, June 2007.

H. Angdinata and X. Xu, “An elementary formal proof of the group law on weierstrass elliptic curves in any characteristic,” arXiv, 2023, doi:10.48550/arXiv.2302.10640.

L. De Feo, “Mathematics of isogeny based cryptography,” arXiv preprint arXiv:1711.04062, 2017, doi:10.48550/arXiv.1711.04062.

D. J. Unger, “Yield criteria representable by elliptic curves and weierstrass form,” Procedia Structural Integrity, vol. 35, no. C, pp. 2–9, 2021, doi:10.1016/j.prostr.2021.12.041.

R. Wituła and D. Słota, “Cardano’s formula, square roots, chebyshev polynomials and radicals,” Journal of Mathematical Analysis and Applications, vol. 363, no. 2, pp. 639–647, 2010, doi:10.1016/j.jmaa.2009.09.056.

D. K. Angdinata and J. Xu, “An elementary formal proof of the group law on weierstrass elliptic curves in any characteristic,” in Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 2023, doi:10.4230/LIPIcs.ITP.2023.6.

S. Lang, Algebra, 3rd ed. Springer, 2002, doi:10.1007/978-1-4613-0041-0.

N. Koblitz, “Good and bad uses of elliptic curves in cryptography,” Moscow Mathematical Journal, vol. 2, no. 4, pp. 693–715, 2002, doi:10.17323/1609-4514-2002-2-4-693-715.

I. Heckenberger, E. Meir, and L. Vendramin, “Finite-dimensional nichols algebras of simple yetter–drinfeld modules (over groups) of prime dimension,” Advances in Mathematics, vol. 444, pp. 1–24, 2024, doi:10.1016/j.aim.2024.109637.

M. c. Kang, “Bezout’s theorem and ideals of terminal forms,” Expositiones Mathematicae, vol. 28, no. 3, pp. 265–268, 2010, doi:10.1016/j.exmath.2009.09.003.

D. Vidakovic, D. Parezanovic, J. Kaljevic, and G. Ivanjica, “Addition and doubling of points 1,” vol. 3, no. July, pp. 25–30, 2013.

Y. Hao et al., “Lightweight architecture for elliptic curve scalar multiplication over prime field,” Electronics, vol. 11, no. 14, pp. 1–24, 2022, doi:10.3390/electronics11142234.

A. Pakapongpun and S. Srisuk, “On the problem of tangency of ellipse curve,” Asian Journal of Applied Sciences, vol. 6, no. 6, pp. 542–546, 2018, doi:10.24203/ajas.v6i6.5534.

K. Fujii and H. Oike, “An algebraic proof of the associative law of elliptic curves,” Advances in Pure Mathematics, vol. 7, no. 12, pp. 649–659, 2017, doi:10.4236/apm.2017.712040.

M. R. Khan et al., “Analysis of elliptic curve cryptography & RSA,” Journal of ICT Standardization, vol. 11, no. 4, pp. 355–378, 2023, doi:10.13052/jicts2245-800X.1142.

D. Kamboj and S. Sharma, “Study of efficient scalar multiplication over elliptic curve,” in Current Topics on Mathematics and Computer Science, 2021, vol. 11, pp. 20–29, doi:10.9734/bpi/ctmcs/v11/4235f.

A. Kak, “Lecture 7: Finite fields (part 4): Finite fields of the form GF(2n), theoretical underpinnings of modern cryptography,” pp. 1–40, 2013, lecture Notes on Computer and Network Security.

S. Bajracharya, C. Shu, K. Gaj, and T. El-Ghazawi, “Implementation of elliptic curve cryptosystems over GF(2n) in optimal normal basis on a reconfigurable computer,” in Lecture Notes in Computer Science, vol. 3203, 2004, pp. 1001–1005, doi:10.1007/978-3-540-30117-2_115.

DOI: https://doi.org/10.37905/euler.v14i2.40284