Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message

Similar documents
A {k, n}-secret Sharing Scheme for Color Images

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

Comparison of Zero Knowledge Authentication Protocols SUBHASISH PARAMANIK (110CS0371)

Pipelined Multipliers for Reconfigurable Hardware

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

Particle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating

Batch Auditing for Multiclient Data in Multicloud Storage

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.

International Journal of Computer Engineering and Applications, ENCRYPTION & DECRYPTION PROCESS BY USING NEWSO TRANSPOSITION METHOD

Dr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

Fast Elliptic Curve Algorithm of Embedded Mobile Equipment

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments

HEXA: Compact Data Structures for Faster Packet Processing

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Robust Dynamic Provable Data Possession

A Block Cipher using Feistal s Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

DoS-Resistant Broadcast Authentication Protocol with Low End-to-end Delay

A Novel Validity Index for Determination of the Optimal Number of Clusters

Gray Codes for Reflectable Languages

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Uplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Implementing Load-Balanced Switches With Fat-Tree Networks

On Optimal Total Cost and Optimal Order Quantity for Fuzzy Inventory Model without Shortage

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

Naïve Bayesian Rough Sets Under Fuzziness

Approximate logic synthesis for error tolerant applications

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Digital Right Management Model based on Cryptography for Text Contents

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

International Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN

Exploring the Commonality in Feature Modeling Notations

Improved Circuit-to-CNF Transformation for SAT-based ATPG

PROJECT PERIODIC REPORT

We don t need no generation - a practical approach to sliding window RLNC

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Smooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints

Optimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints

Torpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control

Graph-Based vs Depth-Based Data Representation for Multiview Images

Outline: Software Design

Discovery and Verification of Neighbor Positions in Mobile Ad Hoc Networks

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering

Acoustic Links. Maximizing Channel Utilization for Underwater

TOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING

A New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam Patel 3 Rakesh Patel 4

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Multi-Channel Wireless Networks: Capacity and Protocols

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode

A Dictionary based Efficient Text Compression Technique using Replacement Strategy

Cluster-Based Cumulative Ensembles

1. Introduction. 2. The Probable Stope Algorithm

Improved flooding of broadcast messages using extended multipoint relaying

Design of High Speed Mac Unit

Accommodations of QoS DiffServ Over IP and MPLS Networks

Cluster-based Cooperative Communication with Network Coding in Wireless Networks

Extracting Partition Statistics from Semistructured Data

A RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL

Diversified Caesar Cipher for Impeccable Security

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Crowd-GPS-Sec: Leveraging Crowdsourcing to Detect and Localize GPS Spoofing Attacks

Episode 12: TCP/IP & UbiComp

Automated Test Generation from Vulnerability Signatures

KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION

Relevance for Computer Vision

Drawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

ISSN (Online), Volume 1, Special Issue 2(ICITET 15), March 2015 International Journal of Innovative Trends and Emerging Technologies

2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,

Simulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R.

SURVEY ON MEDICAL IMAGE SEGMENTATION USING ENHANCED K-MEANS AND KERNELIZED FUZZY C- MEANS

The recursive decoupling method for solving tridiagonal linear systems

User-level Fairness Delivered: Network Resource Allocation for Adaptive Video Streaming

Time delay estimation of reverberant meeting speech: on the use of multichannel linear prediction

An Improved Brain Mr Image Segmentation using Truncated Skew Gaussian Mixture

Diffusion Kernels on Graphs and Other Discrete Structures

Gradient based progressive probabilistic Hough transform

Defect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing

CleanUp: Improving Quadrilateral Finite Element Meshes

An Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index

Visualization of patent analysis for emerging technology

Detection and Recognition of Non-Occluded Objects using Signature Map

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Sparse Certificates for 2-Connectivity in Directed Graphs

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

Quad copter Control Using Android Smartphone

An Efficient and Scalable Approach to CNN Queries in a Road Network

A PROTOTYPE OF INTELLIGENT VIDEO SURVEILLANCE CAMERAS

Transcription:

ISSN:1991-8178 Australian Journal of Basi and Applied Sienes Journal home page: www.ajbasweb.om A new Divide and Shuffle Based algorithm of Enryption for Text Message Dr. S. Muthusundari R.M.D. Engineering College, Department of Computer Siene & Engineering, S. Muthusundari, PO Box 601 206, Kavaraipettai, Chennai, India. A R T I C L E I N F O Artile history: Reeived 16 April 2015 Aepted 12 June 2015 Available online 10 July 2015 Keywords: ipher text, reverse, divide, shuffle, seurity A B S T R A C T In today s situation, data is transmitted over network needs protetion form hakers. Seurity plays a ruial part in transmissions. Enryption and deryption algorithms take a vital role in providing the data seurity against the attaks. Enryption of data is an important topi for researh, as seure and effiient algorithms are needed in order to optimize enryption and deryption of data[1]. This paper proposes a new enryption algorithm, whih uses reverse onept of the text message to enrypt and to derypt the message whih uses divide and Shuffle methods. This algorithm provides high seurity in transmission over network 2015 AENSI Publisher All rights reserved. To Cite This Artile: Dr S. Muthusundari., A new Divide and Shuffle Based algorithm of Enryption for Text Message. Aust. J. Basi & Appl. Si., 9(20): 492-496, 2015 INTRODUCTION The data transmission between sender and reeiver over the network needs to be proteted from unauthorized parties. Data integrity, authentiation, and serey of exhanged data should be made while they are in transmission. The data should be effetively enrypted at the sender side and only the intend reeiver should be able to interpret the ipher text message. Proper keys should be used to enrypt and derypt the text messages. The original message of the sender alled as the plain text is onverted into an unreadable form, alled as ipher text. The ipher text is transmitted over the network to the reeiver, who derypts it into original message using the same private key [2]. There are several reasons for using enryption (examples are given below, and the rypto system that one should use is the one best suited for one's partiular purpose and whih satisfies the requirements of the following. Ease-of-use Reliability Seurity Related Work: S.P Padia et al (2012) have proposed a new plain text based transposition method. Earlier they developed few transposition tehniques[10]. In this paper they have attempted to enhane those tehniques and made them more advaned. In the old tehnique suh as rail fene, they are key based to enrypt the plain text. They have exposed already in the journal paper, the reverse transposition tehnique and Odd-Even transposition tehnique (The IUP journal of Computer sienes, Vol. V, No. 4, 2011) are in whih key is depend on the plaintext so that sender or reeiver an easily understand and easily derypt the ipher text into plaintext but these tehniques does not provide any limitation for the generation of key value. And it does not provide any idea about the digits, haraters and speial harater. There is no provision to reapture blank spaes of the words of the plaintext. Yashpalsingh Rajput et al (2014) have proposed an Improved Cryptographi Tehnique for the enryption of text message using double enryption. This work proposes an improved sheme for the enryption of the plain text message for its seurity[6]. All the onventional enryption tehniques are very weak and brute fore attak and traditional ryptanalysis an be used to easily determine the plain text from enrypted text. In this work of enryption tehnique, a new ombined onept of onventional easer ipher algorithm with hill ipher algorithm is used to make enryption tehnique a muh more seure and stronger than the earlier onept. The deryption proess is very diffiult. The proposed system is divided into two phases. In first phase, to enrypt a new substitution approah is used as first enrypted text. The enryption is done using variable length key whih depends on the string length. In the seond phase, the hill ipher tehnique is applied on the first enrypted Corresponding Author: Dr. S. Muthusundari, R.M.D. Engineering College, Department of Computer Siene & Engineering, PO Box. 601 206, Kavaraipettai, Chennai, India. E-mail: nellailath@yahoo.o.in

493 Dr. S. Muthusundari, 2015 text to produe new enrypted text or ipher text. Based on the deryption key, the reeiver an generate the original text message. Bhagat et al (2013) have proposed a Reverse Enryption Algorithm: A Tehnique for Enryption & Deryption. This paper has proposed a new enryption algorithm, alled Reverse Enryption Algorithm (REA). This proposed algorithm is very simple and has very fast approah. REA enryption algorithm provides a seured enryption and ost benefits method. Himanshu Gupta and Vinod kumar sharma (2013) have proposed a Multiphase Enryption: A New Conept in Modern Cryptography. The onventional methods of enryption an only dealt with maintaining the data seurity [4]. The information ould be aessed by the unauthorized user to lead maliious purpose. Therefore, it is neessary to apply effetive enryption/ deryption methods to enhane data seurity. The multiple enryption tehniques of present time annot provide suffiient seurity. In this researh paper, the new enryption tehnique named as Multiphase Enryption is proposed. In this enryption tehnique, original data is enrypted several times with different strong enryption algorithms at eah time. This enryption tehnique enhanes the omplexity in enryption algorithm at a great extent. Ernastuti (2014) proposed a Perfet Shuffle algorithm for ryptography. This paper proposes the new algorithm based on perfet shuffle tehnique. It is alled Perfet Shuffle Crypto Algorithm (PSCA) whih is lassified as a transposition or permutation tehnique in the rypto system [5]. The PSCA is an asymmetry key enryption, uses a pair of keys, that are a publi key for enrypting data, and a orresponding private seret key for derypting. PSCA is very fast and simple for tehnial support. For the linear plaintext length of N=2n, it will take O (N log N) to omplete both enryption and deryption proess. The PSCA is provided a seure, espeially for ipher text-only attak. It is enabling to apply PSCA as a basi algorithm alternative to develop or reate a rypto algorithm whih employs the layered sheme. Proposed Methodology: The proposed enryption algorithm has the following features. A. Algorithm: 1. Get the plain text from the sender 2. Reverse the plain text as ipher text Fig. 1: Enryption algorithm. B. Working priniple of enryption proess: The original message: welome 1. Plain text: welome 2. Reverse the plain text : emolew Cipher Text: emolew C. Enryption Blok diagram: D. Deryption Algorithm: The deryption algorithm performs the reverse operations of enryption suh that P = D (K, C). It is done in three steps. The proedures are as follows, Fig. 2: Enryption Blok Diagram. 1. Get the ipher text from the sender 2. To find the Mid value = n/2 3. If n is even then 3 a) divide the list in to two halves as 1 to mid value and mid + 1 to n. b) Eah divided list of its own array element shuffle in its position.

494 Dr. S. Muthusundari, 2015 4. If n is odd then 4 a) divide the list in to two halves as 1 to mid -1 and mid + 1 to n b) repeat step 3 b) ) and keep the mid value as in its position 5. original plain text Fig. 3: Deryption Algorithm. E. Working priniple of Deryption Proess 1. Get the ipher text from the sender ipher text: e m o l e w 2. To find the mid value: n = 7 Mid value = 7/2 = 3.5, hene onsider mid = 4 3. n is not even so step 4 will funtion. 4. n is odd then 4 a) divide the list in to two halves as 1 to mid -1 and mid + 1 to n 1 2 3 4 5 6 7 e m o l e w e 4 b) Eah divided list of its own array elements shuffle in its position. 1 2 3 4 5 6 7 e m o l w e w m o l e e w m o w e o w e l l m e l e e o m e 5 Original Plain Text: welome F. Deryption Blok Diagram Fig. 4: Deryption Blok Diagram. G. Case Study I:

495 Dr. S. Muthusundari, 2015 Enryption Proess Plain text: ashwin Cipher text: n i w h s a Deryption proess 1. the ipher text: n i w h s a 2. find the mid value: n= 6 Mid = 6/2 = 3 3. N is even. 3 a) divide the list into two halves n i w h s a 3 b) shuffle by its own array n i w h s a Plain Text : a s h w i n RESULTS AND DISCUSSIONS To study the effetiveness of this proposed algorithm ompares with respet to enryption using Double enryption [1] and Multiphase [2] enryption algorithm. We have used programming language C to implement both the algorithms. The implementation results show that the performane of the proposed algorithm is ahieving better than the enryption algorithm using Double and Multiphase enryption algorithm. A few ase studies have been arried out to get an average of this study; the result is given in the table 1 with respet to time taken to enrypt & derypt proess. Based on the analysis of the result, the proposed algorithm is ensured its performane. Table 1: Comparison with respet to time taken to enrypt & Derypt Sno Data Time taken to enrypt & Derypt in seonds Double enryption Multiphase enryption Proposed method 1 100 23 34 21 2 250 42 38 24 3 350 48 43 36 4 500 65 49 45 5 750 76 58 56 Fig. 5: Performane with respet to enrypt & Derypt data. Conlusion: In this paper we have presented an implementation of reverse and shuffle algorithm for seured message ommuniation. The main objetive was to evaluate the performane of this algorithm in terms of data size. The results have shown that the proposed enryption algorithm was very effetive in omplexity and seurity. It was ahieved the

496 Dr. S. Muthusundari, 2015 effetiveness to enrypt the message from the ase study. The omputing time also minimum with respet to Double and Multiphase enryption from table 1. The Enryption algorithm, presented above, is a simple, diret method using reverse and shuffle tehnique. Consequently, it is reliable fast and suitable for high speed enryption appliations. The n value heking of ipher text transmission gives strength to this enryption algorithm. The ombination of reverse, divide and shuffle makes the deryption proess very reliable and serey. symmetri enryption algorithms, International Journal of Network Seurity, 10(3): 213-219. Elminaam, D.S.A., H.M.A. Kader and M.M. Hadhoud, 2010. Evaluating the effets of symmetri ryptography algorithms on power onsumption for different data types, International Journal of Network Seurity, 11(2): 78-87. REFERENCES Muthusundari, S., S. Santhosh Baboo, 2012. A New Enryption method for seured message passing by Soritng Tehnique, Seond International Conferene CCSIT, Bangalore,(Springer). Jan Mohammad Najar, Shahid Bashir Dar, 2014. A New Design Of A Hybrid Enryption Algorithm,International Journal of Engineering & Computer Siene, 3(11). Dr. Prerna Mahajan, Abhishek Sahdeva, 2013. A Study of Enryption Algorithms AES, DES and RSA for Seurity, Global Journal of Computer Siene and Tehnology Network, Web & Seurity Volume 13Issue 15 Version 1.0. Himanshu Gupta, 2013. Multiphase Enryption Tehnique, International Journal of Computer Theory and Engineering, 5(4). Ernastut, 2014. Perfet Shuffle Algorithm For Cryptography, ARPN Journal of Engineering and Applied Sienes, 9(12). Yashpalsingh Rajput, 2014. An Improved Cryptographi Tehnique to Enrypt Text using Double Enryption, International Journal of Computer Appliations (0975 8887) 86(6). Henk, C.A. van Tilborg, Fundamentals of Cryptology, pp: 9-21. Nordin, M., A. Rahman, A.F.A. Abidin, Mohd Kamir Yusof, N.S.M. Usop, 2013. Cryptography: A New Approah of Classial Hill Cipher, IJSA, 7(2). Kashish Goyal, Supriya Kinger, 2013. Modified Caesar Cipher for Better Seurity Enhanement, International Journal of Computer Appliations, 73(3). Padiya, S.D. and D.N. Dhakane, 2012. Plain Text based Transposition Method, International Journal of Advaned Researh in Computer Siene and Software Engineering, 2(7). William Stallings, 2003. Cryptography and Network Seurity, 3 rd edition, Pearson Eduation. Priti V. Bhagat and Kaustubh S. Satpute, 2013. Reverse Enryption Algorithm: A Tehnique for Enryption & Deryption, International Journal of Latest Trends in Engineering and Tehnology (IJLTET), 2(1). Elminaam, D.S.A., H.M.A. Kader and M.M. Hadhoud, 2010. Evaluating the performane of