Speeding up the computations of elliptic curves cryptoschemes
نویسندگان
چکیده
منابع مشابه
Speeding up Huff Form of Elliptic Curves
This paper presents faster inversion-free point addition formulas for the curve y(1 + ax) = cx(1 + dy). The proposed formulas improve the point doubling operation count record from 6M + 5S to 8M and mixed addition operation count record from 10M to 8M. Both sets of formulas are shown to be 4-way parallel, leading to an effective cost of 2M per either of the group operations.
متن کاملSpeeding up elliptic curve discrete logarithm computations with point halving
Pollard rho method and its parallelized variants are at present known as the best generic algorithms for computing elliptic curve discrete logarithms. We propose new iteration function for the rho method by exploiting the fact that point halving is more efficient than point addition for elliptic curves over binary fields. We present a careful analysis of the alternative rho method with new iter...
متن کاملSpeeding up the computations on an elliptic curve using addition-subtraction chains
We show how to compute x using multiplications and divisions We use this method in the context of elliptic curves for which a law exists with the property that division has the same cost as multiplication Our best algorithm is faster than the ordinary binary algorithm and speeds up accordingly the factorization and primality testing algorithms using elliptic curves Introduction Recent algorithm...
متن کاملSpeeding Up Secure Computations via Embedded Caching
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setting. Although various algorithms in data mining have been enhanced to incorporate secure mechanisms for data privacy preservation, their computation performance is far too high to allow them to be practically useful. Th...
متن کاملSpeeding up computations via molecular biology
We show how to extend the recent result of Adleman 1] to use biological experiments to directly solve any NP problem. We, then, show how to use this method to speedup a large class of important problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1997
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(97)00017-5