discrete logarithmic problems
1 article · search the full text for this term
-
Efficient Computation of Point Multiplication in the Implementation of Elliptic Curve Cryptography
Abstract: In recent times, elliptical curves have been used for public-key cryptographic and signature schemes in information security. The security provided by elliptic curve cryptographic protocols, either using signature or public-key encryption, is entirely based on the discrete logarithm problem. The discrete logarithm problem says that for a given a point Q that is a certain multiple k of a fixed point P, how to find the value of k in …
Published in E-Commerce for Future & Trends · Vol. 1, Issue 1, 2014 · pp. 1–5 Read article