Accelerated search for Gaussian generator based on triple prime integers

Journal of Computer Science

Volumn 5, Issue 9, 2009, Pages 614-618

  Verkhovsky, Boris S ^a   Sadik, M Shiblee ^b  

^a University Heights   (United States)

^b UNIVERSITY OF OKLAHOMA   (United States)

Author keywords

Communication network security; Crypto immunity; Primitive root; Public key cryptography

Indexed keywords

EID: 70349188462     PISSN: 15493636     EISSN: None     Source Type: Journal    
DOI: 10.3844/jcssp.2009.614.618     Document Type: Article

References (12)

1. Boneh, D., 1998. The decision diffie-hellman problem. Lecture Notes Comput. Sci., 1423: 48-63.
2. Diffie, W. and M. Hellman, 1976. New directions in cryptography. IEEE. Trans. Inform. Theor., 22: 644-654. http://www.citeulike.org/user/junin/ article/504050
3. ElGamal, T., 1985. A Public-key cryptosystem and a digital signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31: 469-472. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?tp= &arnumber=1057074&isnumber=22749
4. Elkamchouchi, H., K. Elshenawy and H. Shaban, 2002. Extended RCA cryptosystem and digital signature schemes in the domain of gaussian integers. Proceeding of the 8th International Conference on Communication Systems, Nov. 25-28, IEEE Xplore Press, USA., pp: 91-95. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1182444
5. Karatsuba, A. and Y. Ofman, 1962. Multiplication of many-digital numbers by automatic computers. Doklady Akad. Nauk SSSR, 145: 293-294.
6. Katz, J. and Y. Lindell, Introduction to Modern Cryptography, Chapman and Hall CRC, London, New York, 2008. ISBN: 1584885513, pp: 534.
7. Pollard, J., 1978. Monte carlo methods for index computation. Math. Comput., 32: 918-924. http://www.jstor.org/stable/2006496
8. Shank, D., 1971. Class number, a theory of factorization and genera. Proc. Symp. Pure Math., 20: 415-440.
9. Toom, A., 1963. The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akad. Nauk SSSR., 150: 496-498. http://www.de.ufpe.br/~toom/articles/engmat/MULT-E.PDF
10. Verkhovsky, B., 2008. Generalized baby-step giant-step algorithm for discrete logarithm problem. Adv. Decis. Technol. Intell. Inform. Syst., IX: 88-90.
11. Verkhovsky, B., 2009. Accelerated cybersecure communication based on reduced encryption/decryption and information assurance protocols. J. Telecomm. Manage., 2 (to appear).
12. Verkhovsky, B., 2008. Information assurance protocols: efficiency analysis and implementation for secure communication. J. Inform. Assurance Secur., 3: 263-269.