Hyperelliptic curves encryption combined with block codes for Gaussian channel: Research Articles

Authors:
I. Jirón;I. Soto;R. Carrasco;N. Becerra
Affiliations:
E2.12, Merz Court, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.;E2.12, Merz Court, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.;E2.12, Merz Court, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.;E2.12, Merz Court, University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.
Venue:
International Journal of Communication Systems
Year:
2006

Citing 0
Cited 2

Secure wireless communication channel by the combination of sphere packing, channel code and space time

MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
A new improvement of the ElGamal algorithm using hyperelliptic curves over a wireless channel

ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new cryptographic system is constructed using a combination of a hyperelliptic curve of genus g = 2 over the Galois field GF(2n) and a Reed–Solomon code (N, K) over the Galois field GF(2m) and this system uses a smaller key than the elliptic curves cryptosystem and the Rivest, Shamir, and Adleman cryptosystem. The design criterion for the combination can be expressed as the data compression condition and addressing capability of the code. In addition, the system performance is compared with other systems; extraordinary improvements of 8 and 16.5 dB can be obtained for a BER = 10-5, when compared with binary phase shift keying and differential chaos shift keying, respectively. This system has a polynomial complexity, which depends on data length and the number of operations in GF(2n). Copyright © 2005 John Wiley & Sons, Ltd.