APPLICATIONS OF ARITHMETIC GEOMETRY IN CRYPTOGRAPHY AND COMPUTATIONAL MATHEMATICS: ELLIPTIC CURVES, FINITE FIELDS AND EMERGING DIRECTIONS

Authors

  • Dodiya Nidhiben Research Scholar, Faculty of Science, Monark University
  • Dr. Ashok Patel Assistant Professor, Faculty of Engineering & Technology, Monark University

Keywords:

Arithmetic Geometry, Elliptic Curve Cryptography, Post-Quantum Cryptography, Supersingular Isogenies, Perfectoid Spaces, Prismatic Cohomology, Algebraic Geometry Codes, Arithmetic Statistics

Abstract

Arithmetic geometry represents the profound synthesis of algebraic geometry and number theory, emerging as a foundational pillar for both abstract mathematical theory and applied computational science. This report provides an exhaustive investigation into the applications of arithmetic geometry within modern cryptography and computational mathematics, tracking the discipline's evolution from the classical study of Diophantine equations to the frontiers of post-quantum cryptographic infrastructure. The analysis extensively evaluates the integration of elliptic curves over finite fields, emphasizing the critical role of rational points, the Schoof-Elkies-Atkin algorithm, and the Elliptic Curve Discrete Logarithm Problem (ECDLP) in establishing secure communication frameworks. Furthermore, the report critically examines the rapid paradigm shift in isogeny-based cryptography, detailing the catastrophic Castryck-Decru attack on the Supersingular Isogeny Diffie-Hellman (SIDH) protocol—a vulnerability exposed through the arithmetic geometry of abelian surfaces and Richelot isogenies—and the subsequent pivot toward the SQIsign protocol. Beyond cryptography, the analysis explores the deployment of algebraic geometry codes on modular curves that surpass the Gilbert-Varshamov bound. Finally, the report synthesizes emerging theoretical developments shaping the future of computational mathematics, including perfectoid spaces, prismatic cohomology, derived algebraic geometry, and arithmetic statistics, illuminating how the most abstract geometrical frameworks continuously inform and revolutionize applied algorithmic paradigms.

References

I. Hartshorne, R. (1977). Algebraic geometry. Springer.

II. Silverman, J. H. (2009). The arithmetic of elliptic curves (2nd ed.). Springer.

III. Gauss, C. F. (1986). Disquisitiones arithmeticae (A. A. Clarke, Trans.). Springer. (Original work published 1801).

IV. Grothendieck, A., & Dieudonné, J. A. (1960–1967). Éléments de géométrie algébrique (Vols. I–IV). Publications Mathématiques de l’IHÉS.

V. Corn, P. (2021). Arithmetic geometry. American Mathematical Society.

VI. Milne, J. S. (1986). Arithmetic duality theorems. Academic Press.

VII. Lang, S. (1983). Fundamentals of Diophantine geometry. Springer.

VIII. Bombieri, E., & Gubler, W. (2006). Heights in Diophantine geometry. Cambridge University Press.

IX. Wiles, A. (1995). Modular elliptic curves and Fermat’s Last Theorem. Annals of Mathematics, 141(3), 443–551.

X. Weil, A. (1949). Numbers of solutions of equations in finite fields. Bulletin of the American Mathematical Society, 55(5), 497–508.

XI. Deligne, P. (1974). La conjecture de Weil: I. Publications Mathématiques de l’IHÉS, 43, 273–307.

XII. Faltings, G. (1983). Endlichkeitssätze für abelsche Varietäten über Zahlkörpern. Inventiones Mathematicae, 73(3), 349–366.

XIII. Langlands, R. P. (1970). Problems in the theory of automorphic forms. Springer.

XIV. Frenkel, E. (2013). Love and math: The heart of hidden reality. Basic Books.

XV. Scholze, P. (2012). Perfectoid spaces. Publications Mathématiques de l’IHÉS, 116(1), 245–313.

XVI. Cohen, H. (1993). A course in computational algebraic number theory. Springer.

XVII. Cremona, J. E. (1997). Algorithms for modular elliptic curves (2nd ed.). Cambridge University Press.

XVIII. Washington, L. C. (2008). Elliptic curves: Number theory and cryptography (2nd ed.). Chapman & Hall/CRC.

XIX. Descartes, R. (1954). The geometry of René Descartes (D. E. Smith & M. L. Latham, Trans.). Dover Publications. (Original work published 1637).

XX. Neukirch, J. (1999). Algebraic number theory. Springer.

XXI. Cox, D., Little, J., & O’Shea, D. (2015). Ideals, varieties, and algorithms: An introduction to computational algebraic geometry and commutative algebra (4th ed.). Springer.

XXII. Bhatt, B., & Scholze, P. (2022). Prisms and prismatic cohomology. Annals of Mathematics, 196(3), 1135–1275.

XXIII. Castryck, W., & Decru, T. (2022). An efficient key recovery attack on SIDH. Cryptology ePrint Archive.

XXIV. Lurie, J. (2009). Higher topos theory. Princeton University Press.

XXV. Smith, A. (2017). 2∞-Selmer groups, 2∞-class groups, and Goldfeld’s conjecture. arXiv preprint arXiv:1702.02325.

XXVI. Klüners, J. (2005). A counter example to Malle’s conjecture on the asymptotics of discriminants. C. R. Math. Acad. Sci. Paris, 340(6), 411–414.

XXVII. Fargues, L., & Scholze, P. (2021). Geometrization of the local Langlands correspondence. arXiv preprint arXiv:2102.13459.

XXVIII. Tsfasman, M. A., Vlăduţ, S. G., & Zink, T. (1982). Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound. Mathematische Nachrichten, 109, 21-28.

XXIX. De Feo, L., Jao, D., & Plût, J. (2014). Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. Journal of Mathematical Cryptology, 8(3), 209-247.

Downloads

Published

01-10-2026

How to Cite

Dodiya Nidhiben, & Dr. Ashok Patel. (2026). APPLICATIONS OF ARITHMETIC GEOMETRY IN CRYPTOGRAPHY AND COMPUTATIONAL MATHEMATICS: ELLIPTIC CURVES, FINITE FIELDS AND EMERGING DIRECTIONS. International Educational Applied Scientific Research Journal, 11(10), 01–07. Retrieved from https://ieasrj.com/journals/index.php/ieasrj/article/view/689