Cryptography Series - Mapping from Finite Fields to ECC

ECC-based cryptographic protocols often use the mapping from finite fields to ECC, that is, the elements in the finite field Fp are mapped to points on the ECC curve. Common algorithms for mapping finite fields to ECC include Try-and_Increment, SWU, Icart, etc. This article introduces the Try-and_Increment algorithm, which is described as follows: The

Golang code implementation of the Try-and_Increment algorithm is as follows:

Reference: "A Review of the Construction and Application of Coding Mapping from Finite Fields to Elliptic Curves"