ID-based cryptographic schemes based on factoring and discrete logarithms

Abstract

We present three identity-based cryptographic schemes based on two-known assumptions. The security of the proposed scheme follows from the difficulties in simultaneously solving the factoring (FAC) and discrete logarithms (DL) problems with arithmetic modulo of almost the same size. The proposed schemes support user identification, digital signature, and key distribution.