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

HTML  Download Download as PDF (Size: 219KB)  PP. 579-584  
DOI: 10.4236/ijcns.2010.37077    4,891 Downloads   8,441 Views  Citations

Affiliation(s)

.

ABSTRACT

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 entanglements 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 proposed authentication cryptocol.

Share and Cite:

B. S. Verkhovsky, "Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements," International Journal of Communications, Network and System Sciences, Vol. 3 No. 7, 2010, pp. 579-584. doi: 10.4236/ijcns.2010.37077.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.