Generating Keys in Elliptic Curve Cryptosystems
Dragan Vidakovic, Dusko Parezanovic
TL;DR
This paper demonstrates how to generate cryptographic keys for elliptic curve cryptosystems using a Delphi 7 console application, focusing on scalar point multiplication in GF(p).
Contribution
It introduces a practical method for key generation in ECC using simple programming tools and scalar multiplication techniques.
Findings
Successful implementation of key generation in Delphi 7
Effective scalar point multiplication in GF(p)
Practical approach for ECC key generation
Abstract
In this paper, we will present how to find keys elliptic curve cryptosystems (ECC) with simple tools of Delphi 7 console application, using the software problem solving of the scalar point multiplication in the field GF(p), where p is an arbitrary prime number.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic