Open Access Open Access  Restricted Access Subscription or Fee Access

Tamil Data Communication Security Using Elliptic Curve Cryptography Key Algorithms

K. Ravikumar, K. Lakshmi, M. Karthikeyan

Abstract


Tamil data, scripts, files needs to be preserved in computing. As there is a need for security in various computer networks fields, the paper mainly focus an algorithm in the field of secrecy , privacy, confidentiality of the documents in a computer system by the principle “ Cryptography “. Cryptography is defined as an art of security technique for computer networks. A computer user to preserve his documents, scripts needs to search for security oriented algorithms, packages, databases which arises an unfulfilled thirst. To quench the security thirst, a recent algorithm namely ‘Elliptic Curve Cryptography (ECC)’ is framed as it is an approach to public-key cryptography based on some algebraic structure of elliptic curves over finite fields. The creator keeps the knowledge of security key mechanisms such as private key, public keys. The keys which are generated best choose random-numbers that uses products of two large prime numbers as the key. Any user to preserve his documents picks two large random primes as his private key, and publishes the product as his public key. The public key based algorithm ‘Elliptic Curve Cryptography (ECC)’ is based on the creation of different keys that are difficult to solve without certain knowledge about how they were created. Elliptic curve cryptosystems is computationally efficient than the first generation public key systems such as RSA and Diffie-Hellman algorithms as the report says. As an added advantage the paper mainly focus on ECC based security algorithms for Tamil document privacy. The document related in Tamil words are analyzed commonly as a process which includes security mechanisms that emerges finally in the system as a preserved document.

Keywords


Elliptic Curve, Scripts, Co-Clustering, Algorithm, Security.

Full Text:

PDF

References


Andrew S. Tanenbaum “ Computer Networks “, Fourth Edition, PHI

Diffie, W., Hellmann, M.E. (1976). New directions in Cryptography. IEEE Transactions in Information Theory, 22, 644-654.

Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48,203-209.

A. Banerjee, I. Dhillon, J. Ghosh, S. Merugu, and D. S. Modha. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. Journal of Machine Learning Research, 8:1919–1986, Aug.2007

R. Niels and L. Vuurpijl. Dynamic TimeWarping Applied to Tamil Character Recognition.Proceedings of the 8th International Conference on Document Analysis and Recognition, 2005.

R. M. Suresh, L. Ganesan, "Recognition of Printed and Handwritten Tamil Characters Using Fuzzy Approach," iccima, pp.291-286, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05),2005, DOI:http://doi.ieeecomputersociety.org/10.1109/ICCIMA 2005.47

M. Jambyu and M. O. Lebeaux. Cluster Analysis and Data Analysis. North- Holland, 1983.

Open source materials -Apertium (http://www.apertium.org/) BLEU kit (ftp://jaguar.ncsl.nist.go/mt/resources/mteval-v13.pl)GIZA (http://www.fjoch.com/GIZA++.html)


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.