CRSep 1, 2013
Generating Keys in Elliptic Curve Cryptosystems
arXiv:1309.0245v17 citations
Originality Synthesis-oriented
AI Analysis
This work provides a domain-specific solution for cryptography practitioners, but it is incremental as it applies existing methods to a new implementation.
The paper tackled the problem of generating keys in elliptic curve cryptosystems by implementing scalar point multiplication in GF(p) using a Delphi 7 console application, resulting in a practical tool for key generation.
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.