11 × 11 Playfair Cipher based on a Cascade of LFSRs
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 12, Issue 1
Abstract
Playfair cipher is one of the better-known multiple letter encryption ciphers. In this method, the diagrams in the plaintext are treated as a single unit and then these units converted into ciphertext diagrams. This paper implements and discusses a new system which proposed by using 11 × 11 Playfair cipher that supports all 26 alphabets in both: upper case letters (A-Z) as well as lower case letters (a-z), ten digits (0-9), special characters and the extended special characters. This combination will tackle the limitation of 5×5 Playfair cipher in which both “i” and “j” letters could not appear simultaneously. In order to increase the level of security of this method, the output of an 11×11 Playfair procedure will be an input to the complete procedure of a cascade LFSRs. Finally, this system was implemented using MATLAB 8.0 (R2012b).
Authors and Affiliations
Ouday Hanosh
Keywords
Related Articles
- EP ID EP87593
- DOI -
- Views 168
- Downloads 0
An Efficient Approach for Prevention of Cooperative Black Hole Attack on DSR Protocol
In the mobile ad hoc networks, the major role is played by the routing protocols in order to route the data from one mobile node to another mobile node with security. But in such mobile networks, routing protocol...
Efficient Algorithm for Mining High Utility Itemsets from Large Datasets Using Vertical Approach
Abstract: High Utility Itemset Mining is a challenging task as the Downward Closure Property present in frequent itemset mining does not hold here. In recent times many algorithms have been proposed for mining high utili...
Real Time Monitoring Of Urban Water Systems for Developing Countries
Abstract: The safe and satisfactory provision of water related services in urban areas of developing countries remain a major challenge mainly attributed to limited resources and inability to promptly detect operat...
Model Based Software Timing Analysis Using Sequence Diagramfor Commercial Applications
Abstract: The verification of running time of a program is necessary in designing a system with real lifeconstrain. Verification defines lower and upper bounds which reflects control flow that depends on data as we...
Implementation of Novel Algorithm (SPruning Algorithm)
Abstract: Decision trees are very significant for taking any type of verdict related to any field. Today there is ample amount of data but that data is uncooked data therefore to make it cooked data, data mining is...