Construction of an elliptic curve over binary finite fields to combine with LDPC code in mobile communication

Authors:
B. Ontiveros;I. Soto;R. Carrasco
Affiliations:
Industrial Engineering Department, Universidad de Santiago de Chile, Chile;Industrial Engineering Department, Universidad de Santiago de Chile, Chile;School of Electrical, Electronic and Computer Engineering, University of Newcastle upon Tyne, UK
Venue:
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Year:
2006

Citing 4
Cited 0

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Elliptic curves in cryptography

Elliptic curves in cryptography
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose the construction of an efficient cryptographic system, based on the combination of the ElGamal Elliptic Curve Algorithm and Low Density Parity Check (LDPC) codes for mobile communication. 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, in order to represent the input alphabet. In this paper we develop algorithms to construct efficient elliptic curves over binary finite field for combination with LDPC codes. A list of the suitable elliptic curves and the study of time to construction elliptic curves is presented.