Mapping an Arbitrary Message to an Elliptic Curve when Defined over GF(2^n), Brian King, Indiana University – Purdue University Indianapolis 723 W Michigan, SL 160 Indianapolis, IN 46202International Journal of Network Security, Vol.8, No.2, PP.169–176, Mar. 2009.
Tagged: plaintext embedding Toggle Comment Threads | Keyboard Shortcuts
Continuing this, from “Problems of Plaintext Embedding on Elliptic Curve” by Fucai Zhou and Jun Zhang, I’m now focusing on the algorithms of plaintext embedding on Elliptic Curve.
Will explore this more, while also learn about affine, standard and jacobi projective.
From this paper:
- Problems of plaintext embedding are the fundamental problems in elliptic curve public key cryptosystems.
- A good embedding algorithm will enhance the encryption speed.
- Plaintext embedding algorithm in binary field presented in the paper is easier to be implemented than that in prime field, and faster.
- Applying the plaintext embedding algorithm to the storage and trasmission of points in elliptic curve can save half of the storage space and bandwidth.