A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Parallelizing GF(P) elliptic curve cryptography computations for security and speed
2007 9th International Symposium on Signal Processing and Its Applications
The elliptic curve cryptography can be observed as two levels of computations, upper scalar multiplication level and lower point operations level. We combine the inherited parallelism in both levels to reduce the delay and improve security against the simple power attack. The best security and speed performance is achieved when parallelizing the computation to eight parallel multiplication operations. This strategy is worth considering since it shows very attractive performance conclusions.doi:10.1109/isspa.2007.4555449 dblp:conf/isspa/GutubIA07 fatcat:rb25cf5gwnc7hl4fk5kgfrqyfu