Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements

A hybrid cryptographic system providing digital authentication is described and analyzed in this paper. The proposed cryptosystem incorporates three features: complexity of the discrete logarithm problem, complexity of integer factorization of a product of two large primes and a combination of symmetric and asymmetric keys. In order to make the cryptosystem less vulnerable to cryptanalytic attacks a concept of digital entan-glements is introduced. As a result, the proposed cryptographic system has four layers (entanglement-encryption-decryption-disentanglement). It is shown that in certain instances the proposed communication cryptocol is many times faster than the RSA cryptosystem. Examples provided in the paper illustrate details of the pro-posed authentication cryptocol