DMCA
ECDKG: A Distributed Key Generation Protocol Based on Elliptic Curve Discrete Logarithm
BibTeX
@MISC{Tang_ecdkg:a,
author = {Caimu Tang},
title = {ECDKG: A Distributed Key Generation Protocol Based on Elliptic Curve Discrete Logarithm },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In public key based cryptosystems, key distribution has been a crucial issue of protocol design. Many attack methods are orchestrated by making use of some weakness at the stage of key distribution. In this report, we also propose a distributed key generation protocol based on elliptic curve discrete logarithm, called ECDKG. Existing distributed key generation protocols use either cryptosystems based on discrete logarithm over a finite field or Integer factorization as a building block. The secrecy has been proven and the secrecy is as strong as the building block systems. However, there are subexponential algorithms for solving this discrete logarithm problem over a field field and the integer factorization problem. Elliptic curve cryptosystem provides a promising alternative for building a distributed key generation scheme and no known subexponential algorithms solve a general version of the discrete logarithm over an additive group derived from a point on an elliptic curve. Main advantages using this building block include the space and time efficiency and flexibility. We also propose the adaptive version and proactive version of ECDKG. An example on how to use ECDKG on ElGamal based message encryption is also given. We will also address some practical implementation issues.
Keyphrases
elliptic curve discrete logarithm distributed key generation protocol building block key distribution subexponential algorithm discrete logarithm general version integer factorization problem proactive version protocol design additive group distributed key generation scheme adaptive version key generation protocol elliptic curve cryptosystem building block system message encryption practical implementation issue promising alternative finite field field field elliptic curve integer factorization crucial issue public key many attack method time efficiency discrete logarithm problem
