Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements
- 1
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.
- B. Verkhovsky, “Entanglements of Plaintext Streams and Cubic Roots of Integers for Network Security,” Advances in Decision Technology and Intelligent Information Systems, Vol. IX, 2008, pp. 90-93.
- B. Verkhovsky, “Information Assurance Protocols: Efficiency Analysis and Implementation for Secure Communication,” Journal of Information Assurance and Security, Vol. 3, No. 4, 2008, pp. 263-269.
- W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Transactions on Information Theory, Vol. IT-22, No. 6, 1976, pp. 644-654.
- R. Rivest, A. Shamir and L. Adleman, “A Method of Obtaining Digital Signature and Public-Key Cryptosystems,” Communication of ACM, Vol. 21, No. 2, 1978, pp. 120-126.
- B. Verkhovsky, “Deterministic Algorithm for Generators of Strong Primes,” CS-06 Research Report, NJIT, 2006.
- M. O. Rabin, “Digitized Signatures and Public Key Functions as Intractable as Factorization,” MIT/LCS Technical Report, TR-212, Cambridge, 1979.
- V. S. Miller, “Use of Elliptic Curves in Cryptography,” Lecture Notes in Computer Science, Vol. 218, No. 85, 1985, pp. 417-426.
- N. Koblitz, “Elliptic Curve Cryptosystems,” Mathematics of Computation, Vol. 48, No. 177, 1987, pp. 203-209.
- N. Koblitz, A. Menezes and S. Vanstone, “The State of Elliptic Curve Cryptography,” Designs, Codes and Cryptography, Vol. 19, No. 2-3, 2000, pp. 173-193.
- N. Koblitz, “Hyperelliptic Cryptosystems,” Journal of Cryptology, Vol. 1, No. 3, 1989, pp. 139-150.
- B. Verkhovsky, “Overpass-Crossing Scheme for Digital Signature,” International Conference on Systems Research, Informatics and Cybernetics, Baden-Baden, Germany, July 29-31, 2001.
- J. M. Pollard, “Monte Carlo Methods for Index Computation Mod P,” Mathematics of Computation, Vol. 32, No. 143, 1978, pp. 918-924.
- V. I. Nechaev, “Complexity of a Deterministic Algorithm for the Discrete Logarithm,” Mathematical Notes, Vol. 55, No. 2, 1994, pp. 165-172.
- A. M. Odlyzko, “Discrete Logarithms: The Past and the Future,” Designs, Codes and Cryptography, Vol. 19, No. 2-3, 2000, pp. 129-145.
- J. M. Pollard, “Kangaroos, Monopoly and Discrete Logarithms,” Journal of Cryptology, Vol. 13, No. 4, 2000, pp. 437-447.
- D. R. Stinson, “Some Baby-Step Giant-Step Algorithms for the Low Hamming Weight Discrete Logarithm Problem,” Mathematics of Computation, Vol. 71, No. 237, 2002, pp. 379-391.