Binary Arithmetic for DNA Computers
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Dna computation: Theory, practice, and prospects
Evolutionary Computation
| Hi-index | 0.00 |
Cryptography based on Elliptic Curves (ECC) has emerged as an effective alternative to the existing public-key cryptosystems (RSA and DSA). Its success was due both to the fact that no fast algorithms were known to break it and that exceptional security levels could be obtained by using short keys. The Elliptic Curve Discrete Logarithm (ECDL) problem is the cornerstone of much of present-day ECCs. It was classifed as a computationally intractable problem and, consequently, as a reliable and unbreakable cryptosystem. In a recent work, Li et al. built a molecular computer designed to solve it over GF(2n). It was based on two DNA-inspired al gorithms: a parallel adder and a parallel multiplier, working in O(n) and O(n2) respectively, where n is the input size. In this paper, we first present two faster biological implementations, working in O(log(n)) and O(n • log(n))respectively (worst case). Then, we propose our model as a reference parallel solution of the ECDL problem and finally we highlight the computational power of such natureinspired paradigm.