Web and Network Communication Security Algorithms

*, **
*Professor, Indur Institute of Eng. & Tech, Andhra Pradesh.
**,*** Associate Professor, Indur Institute of Eng. & Tech, Andhra Pradesh.
****Director, Centre for Continuing& Distance education,J.N.T.U, Hyderabad .
DOI : https://doi.org/

Abstract

One of the recent developments in telecommunication industry is the introduction of communications through internet. Some of the applications of internet are easy communications, vast library of information at one place, electronic business through internet, e learning modules and so on. As the usage is increasing the problem of privacy and security to data is also increasing. In this context, security to the data comes into picture.

Anyone designing a product, that will be connected to the internet should be concerned about network security. T &T algorithm is pre-integrated with a wide range of security mechanisms. The broad range of choices makes it easy for the developer to determine the appropriate level of security necessary for their device and deploy it with virtually no impact to their schedules or time to market.

It is generally agreed that the most powerful tool in providing network security is encryption. In this work, some encryption algorithms are going to be discussed in terms of their code breaking time, computational complexity and response time.

Keywords

R.S.A. Algorithm, Substitution Algorithm, T&T Algorithm, Comparative Study, Examples

How to Cite this Article?

Krishna A.V.N, Vishnu Vardhan B, Pavan Roy M and Vinaya Babu A (2006). Web and Network Communication Security Algorithms. i-manager’s Journal on Software Engineering, 1(1), Jul-Sep 2006, Print ISSN 0973-5151, E- 2230-7168, pp. 12-14.

References

[1].Henry Baker and Fred Piper : cipher systems(North wood books,London 1982)
[2].R.S.Thore & DBTalange security of internet to pager Email messages (Internet for India-1997IEEE Hyderabad section) page No.89-94.
[4]. Diffie W & Hellman M.E : New directions in cryptography , IEEE Trans. 1976, IT -22 , pp .644-654.
[5]. Brassard G. : Modern cryptology , a tutorial lecture Notes computer science , (325) ,(spring-verlas) .
[6]. Rabin . M.O : Probabilistic algorithm for testing primality , J.Number theory, 1980 , 12 pp 128-138.
[7]. Bruce Schneier : Applied cryptography ( John Wiley & sons(ASIA) Pte Ltd.
If you have access to this article please login to view the article or kindly login to purchase the article
Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.

Purchase Instant Access

Single Article

USD EUR INR
Print 35 35 200
Online 35 35 200
Print & Online 35 35 400