An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem

In 1984, Shamir proposed the concept of the identity-based (ID-based) cryptosystem. Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large publickey file is not required. Since new cryptographic schemes always face security challenges and many discrete logarithm and integer factorization problem-based cryptographic systems have been deployed, therefore, the purpose of this paper is to design a transformation process that can transfer all the discrete logarithm and integer factorization based cryptosystems into the ID-based systems rather than re-invent a new system. In addition, no modification of the original discrete logarithm and integer factorization based cryptosystems is necessary.