Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2(n))

Elliptic curve cryptographic algorithms convert input data to unrecognizable encryption and the unrecognizable data back again into its original decrypted form. The security of this form of encryption hinges on the enormous difficulty that is required to solve the elliptic curve discrete logarithm p...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Kenli, Zou, Shuting, Xv, Jin
Formato: Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2008
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2292844/
https://www.ncbi.nlm.nih.gov/pubmed/18431451
http://dx.doi.org/10.1155/2008/518093

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2292844/
https://www.ncbi.nlm.nih.gov/pubmed/18431451
http://dx.doi.org/10.1155/2008/518093

Ejemplares similares