• No results found

TO STUDY NETWORK SECURITY AND CRYPTOGRAPHY

N/A
N/A
Protected

Academic year: 2020

Share "TO STUDY NETWORK SECURITY AND CRYPTOGRAPHY"

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

Available Online at www.ijpret.com 1179

INTERNATIONAL JOURNAL OF PURE AND

APPLIED RESEARCH IN ENGINEERING AND

TECHNOLOGY

A PATH FOR HORIZING YOUR INNOVATIVE WORK

TO STUDY NETWORK SECURITY AND CRYPTOGRAPHY

ASHVINI S. GORTE1, PROF. NIKHIL S. BAND2, DR. HEMANT R. DESHMUKH3 1.Student of Master of Engineering in (CSE), IBSS college of Engineering and Technology, Amravati, India.

2.Assistant professor Department of (CSE), IBSS College of Engineering and Technology, Amravati, India. 3.Head of the Department of (CSE), IBSS College of Engineering and Technology, Amravati, India.

Accepted Date: 05/03/2015; Published Date: 01/05/2015

Abstract:This article discusses the state of the art of cryptographic algorithms as deployed for securing computing networks. While it has been argued that the design of efficient cryptographic algorithms is the “easy” part of securing a large scale network, it seems that very often security problems are identified in algorithms and their implementations. Cryptography is an emerging technology, which is important for network security. Research on cryptography is still in its developing stages and a considerable research effort is still required for secured communication.

Keywords:Cryptography, Network Security.

Corresponding Author: MS. ASHVINI S. GORTE

Access Online On:

www.ijpret.com

How to Cite This Article:

Ashvini S. Gorte, IJPRET, 2015; Volume 3 (9): 1179-1184

(2)

Available Online at www.ijpret.com 1180

INTRODUCTION

Network Security & Cryptography is a concept to protect network and data transmission over wireless network. Network security involves the authorization of access to data in a network, which is controlled by the network officer. Users choose or are assigned an ID and password or other authenticating information that allows them access to information and programs within their authority. Network security starts with authenticating the user, commonly with a username and a password. Since this requires just one detail authenticating the user name — i.e. the password, which is something the user 'knows'— this is sometimes termed one factor verification. With two-factor verification, something the user 'has' is also used (e.g. a security token or 'dongle', an ATM card, or a mobile phone); and with three-factor authentication, something the user 'is' is also used (e.g. a fingerprint or retinal scan).

II.CRYPTOGRAPHY

Type of operations used for transforming plain text to cipher text All the encryption algorithms are based on two general principles: substitution, in which each element in the plaintext is mapped into another element, and transposition, in which elements in the plaintext are rearranged. The number of keys used If the sender and receiver uses same key then it is said to be symmetric key (or) single key (or) conventional encryption. If the sender and receiver use different keys then it is said to be public key encryption.

Applying Cryptography

Key Based Cryptography

(3)

Available Online at www.ijpret.com 1181 1. In Private key Cryptography, both the sender and the recipient share a key that must be kept private. In order to communicate with each other, the key must be passed between the two, this process is known as the key allocation and is quite complicated and difficult to do properly.

2. While in Public Key Cryptography, each party has two sets of keys, one key is published to the public, called the Public key, while the other is kept secret and only known by the owner, the Private key.

What network security and cryptography will provide:

i. Authentication

The case of an ongoing interaction, such as the connection of a terminal to a host, two aspects are involved. First, at the time of connection initiation, the service assures that the two entities are authentic, that is, that each is the entity that it claims to be. Second, the service must assure that the connection is not interfered with in such a way that a third party can masquerade as one of the two legitimate parties for the purposes of unauthorized transmission or reception.

Peer Entity Authentication:

Provides for the corroboration of the identity of a peer entity in an association. Two entities are considered peers if they implement to same protocol in different systems; e.g., two TCP modules in two communicating systems. Peer entity authentication is provided for use at the establishment of, or at times during the data transfer phase connection.

Data origin authentication: Provides for the corroboration of the source, of a data unit. It does not provide protection against the duplication or change of data units. This type of service supports applications like electronic mail, where there are no prior interactions between the communicating entities.

Data privacy: privacy is the protection of transmitted data from passive attacks. With respect to the content of a data transmission, several levels of protection can be identified. The broadest service protects all user data transmitted between two users over a period of time.

(4)

Available Online at www.ijpret.com 1182 with a stream of messages, assures that messages are received as sent with no duplication, insertion, modification, reordering, or replay.

The Encryption Techniques:

Symmetric encryption is a form of cryptosystem in which encryption and decryption are performed using the same key. It is also known as conventional encryption. Symmetric encryption, also referred to as conventional encryption or single-key encryption was the only type of encryption in use prior to the development of public key encryption in the 1970s. Before beginning, we define some terms. An original message is known as the plaintext, while the coded message is called the ciphertext. The process of converting from plaintext to cipher text is known encryption.

III.SECURITY ATTACKS

A useful means of classifying security attacks, used both in X.800 and RFC 2828, is in terms of passive attacks and active attacks. A passive attack attempts to learn or make use of information from the system but does not affect system resources.

Passive Attacks

Passive attacks are in the nature of eavesdropping on, or monitoring of, transmissions. The goal of the opponent is to obtain information that is being transmitted. Two types of passive attacks are the release of message contents and traffic analysis.

Active Attacks

(5)

Available Online at www.ijpret.com 1183

The Goals of Cryptography

Consider Bob and Alice, as we have discussed in the last class, they are the two most popular characters which are used to describe a cryptographic scenario, and they send information like suppose, Dear Alice Like, instead of saying dear Alice, it should not be something else; so that there is a kind of misunderstanding between Bob and Alice.

Confidentiality:

As we have said just now, that the information is being exchanged over untrusted network and we have to provide confidentiality in such a setting. So, therefore, the information, while in replace should remain secret. When the message is being passed from say, Alice or Bob or over an untrusted network, it should be confidential and it should not be opened up to person like eve, who is not authorized to use the piece of information.

IV.STEGANOGRAPHY

A plaintext message may be hidden in any one of the two ways. The methods of steganography conceal the existence of the message, whereas the methods of cryptography render the message unintelligible to outsiders by various transformations of the text. A simple form of steganography, but one that is time consuming to construct is one in which an arrangement of words or letters within an apparently innocuous text spells out the real message.

V.CONCLUSION

Security often requires that data be kept safe from unauthorized access. And the best line of defense is physical security (placing the machine to be protected behind physical walls). However, physical security is not always an option (due to cost and/or efficiency considerations). Instead, most computers are interconnected with each other openly, thereby exposing them and the communication channels that they use.

VI. REFRENCES:

1. Landau, Susan (2004). "Review of Handbook of Applied Cryptography by A. J. Menezes, P. C.

Oorschot, and S. A. Vanstone and 9 other books by various authors". Bull. Amer. Math. Soc. (N.S.) 41 (3): 357–367.

(6)

Available Online at www.ijpret.com 1184

3. Bluetooth CIG, Specification of the Bluetooth system, Version 1.1, February 22, 2001.

Available from www.bluetooth.com.

4. I. Mantin. Predicting and Distinguishing Attacks on RC4 Keystream Generator. Eurocrypt Vol.

3494 of LNCS, pp. 491-506, Springer-Verlag, 2005.

5. G. Gong, K. C. Gupta, M. Hell, and Y. Nawaz, Towards a General RC4-like Key stream

Generator, SKLOIS Conference on Information Security and Cryptology (CICS05), December15-17, Beijing, China. Springer-verlag, 2006. (Download: http://comsec.uwaterloo.ca.)

6. eSTREAM - The ECRYPT Stream Cipher Project, http://www.ecrypt.eu.org/stream/ [6] Y.

Nawaz and G. Gong, WG: A family of stream ciphers with designed randomness properties, Information Sciences, Vol. 178, No. 7, April 1, 2008, pp. 1903-1916.

7. National Bureau of Standards, Data Encryption Standard, FIPS Publication 46, U.S.

Department of Commerce, 1977.

References

Related documents

Then we treat is meeting the requirement.So this paper put forward a local optimize compensation method which based on the machining accuracy.In the process

The findings established that cognitive learning strategies commonly used by students while preparing for national examinations included: elaborative strategies;

Where COST OF TAIL BITING includes the same elements as above, but as at a higher level, ie.: 2% * (TBpain + TBinf + TBincome_reduction + TBworkload); and BENEFITS OF NO TAIL

corner feature, the gradient descent method converged to a local maximum over half of the time.. While the gradient descent method did show a significant statistical increase in

Comparing simulated parameters for each iteration of Koch fractal antenna like reflection coefficient, VSWR, gain with conventional triangular patch antenna, we can

A discretization of the resulting problem by a Discontinuous Galerkin method is proposed in Section 3, together with an analysis of the semi-discretized problem.. Numerical results