ePrints

Hyperelliptic curves encryption combined with block codes for Gaussian channel

Lookup NU author(s): Emeritus Professor Rolando Carrasco

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

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(2 m) 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.

Publication metadata

Author(s): Jiron I, Soto I, Carrasco R, Becerra N

Publication type: Article

Publication status: Published

Journal: International Journal of Communication Systems

Year: 2006

Volume: 19

Issue: 7

Pages: 809-830

ISSN (print): 1074-5351

ISSN (electronic): 1099-1131

Publisher: John Wiley & Sons Ltd.

URL: http://dx.doi.org/10.1002/dac.771

DOI: 10.1002/dac.771

Altmetrics

Share