ePrints

Construction of an elliptic curve over finite fields to combine with convolutional code for cryptography

Lookup NU author(s): Beatriz Ontiveros, 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

The construction of an efficient cryptographic system, based on the combination of the ElGamal elliptic curve algorithm and convolutional codes using the Viterbi decoding algorithm over the Gaussian channel, is proposed. The originality is based on the construction of the mapping of encryption and coding at the channel level and the constraints imposed on the construction of the elliptic curve. When using elliptic curves and codes for cryptography it is necessary to construct elliptic curves with a given or known number of points over a given finite field with a range of constraint lengths, in order to represent the input alphabet and produce channel gain, respectively. The results show that the benefit of coding with encryption increases the security and coding gain and reduces the expansion factor, but at the expense of higher complexity. © The Institution of Engineering and Technology 2006.

Publication metadata

Author(s): Ontiveros B, Soto I, Carrasco R

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 4th International Symposium on Communication Systems, Networks and DSP

Year of Conference: 2006

Pages: 299-306

ISSN: 1350-2409

Publisher: IEE Proceedings: Circuits, Devices and Systems, IEEE

URL: http://dx.doi.org/10.1049/ip-cds:20050117

DOI: 10.1049/ip-cds:20050117

Library holdings: Search Newcastle University Library for this item

ISBN: 17518598

Share