A Python Programming Initiative for Elliptic Curves over Finite Fields

Seddik Abdelalim

LMFA, FSAC, University Hassan II of Casablanca, Morocco.

Ilias Elmouki *

LMFA, FSAC, University Hassan II of Casablanca, Morocco.

Noreddine Abghour

LIS Labs, FSAC, University Hassan II of Casablanca, Morocco.

*Author to whom correspondence should be addressed.


Abstract

This study introduces algorithmic schemes in Python for computing some concepts in elliptic curves, namely point addition, Cayley’s table, Diffie-Hellman protocol, and Schoof’s problem. For this, we provide 10 examples to motivate the reader to become familiar with programming on this topic.

Keywords: Polynomial irreducibility, finite field, elliptic curve, Cayley’s table, Diffie-Hellman protocol, Hasse theorem Schoof ’s algorithm


How to Cite

Abdelalim, S., Elmouki, I., & Abghour, N. (2025). A Python Programming Initiative for Elliptic Curves over Finite Fields. Finite Abelian Groups, Elliptic Curves, Blockchain With Hashing and Graphs, 250–263. https://doi.org/10.9734/bpi/mono/978-81-992493-9-4/CH7