A new improvement of the ElGamal algorithm using hyperelliptic curves over a wireless channel

Iván Jirón, Ismael Soto, R.A. Carrasco · International Conference on Communications · 2006

The aim of this paper is to show a new improvement of the ElGamal algorithm using the construction of very strong one-way functions based on the concatenation of a family of hyperelliptic curves and a Low-density parity-check code, which allows key exchange, data encryption and reliable data transmission on a fading channel. Further, the security level is studied and compared with other cryptosystems. Finally, the complexity of concatenation algorithm is discussed.

Read the paper · More papers on PaperTik