Cryptographic identification of users based on inter-mixed approach

This study presents three identity-based cryptographic schemes, based on two-known assumptions. Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms. These assumptions appear secure today; but, it is possible that efficient algorithms will be developed in the future to break one or more of these 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. Each user in the system uses common arithmetic modulo and only requires one public key and one private key. The proposed schemes support user identification, digital signature, and key distribution.