Construction of an elliptic curve over binary finite fields to concatenate with LDPC codes in wireless communication
Keywords: systems, models, binary, algorithm, density, fields, curves, communication, parity, algorithms, curve, data, finite, low, codes, cryptography, mathematical, Elliptic, (symbols), check
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 wireless communication systems. 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, time to construction elliptic curves and data transmission performance studies are carried out.
Más información
Título según SCOPUS: | Construction of an elliptic curve over binary finite fields to concatenate with LDPC codes in wireless communication |
Título de la Revista: | WSEAS Transactions on Communications |
Volumen: | 5 |
Número: | 9 |
Editorial: | World Scientific and Engineering Academy and Society |
Fecha de publicación: | 2006 |
Página de inicio: | 1758 |
Página final: | 1762 |
Idioma: | eng |
URL: | http://www.scopus.com/inward/record.url?eid=2-s2.0-33747063833&partnerID=q2rCbXpz |
Notas: | SCOPUS |