Premium
Hyperelliptic curves encryption combined with block codes for Gaussian channel
Author(s) -
Jirón I.,
Soto I.,
Carrasco R.,
Becerra N.
Publication year - 2006
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.771
Subject(s) - hyperelliptic curve , cryptosystem , galois theory , finite field , computer science , encryption , advanced encryption standard , cryptography , code (set theory) , discrete mathematics , arithmetic , algorithm , mathematics , computer network , set (abstract data type) , programming language
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(2 n ) 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(2 n ). Copyright © 2005 John Wiley & Sons, Ltd.