Skip to main content

Play Fair Cipher

The best-known multiple-letter encryption cipher is the Play fair, which treats diagrams
in the plaintext as single units and translates these units into ciphertext diagrams.3
The Playfair algorithm is based on the use of a 5 × 5 matrix of letters constructed
using a keyword. This cipher was actually invented by British scientist Sir Charles Wheatstone in 1854, but it bears the name of his friend Baron Playfair of St.Andrews, who championed the cipher at the British foreign office.

We had to create our own version of PlayFairCipher. I used Java as my Programming language and created this file PlayFairCipher.java . My Cipher's Key is "WORD". I used 'I' instead of 'J' and 'X' for inserting within double letters
Labels:

Comments

Post a Comment

Popular posts from this blog

Scan Conversion(Circle) - Midpoint Algorithm

Assignment 05. Use the mid-point circle technique to derive the necessary equations to scan convert the following circular sector (i.e., points from  27 0 o  to 315 o ) .  Implement your method and u se the circle's symmetric property to draw complete circles.   The file is available here ( ScanConvertCirclemidpoint.cpp ) Play with it. You will understand..
1 comment
Read more

TrashCoders

As I'm forming a Club "TrashCoders" after our Summer Holidays (May 2nd week), and going to share the knowledge I have, I created a new blog to upload all of the works we do in the Club. Hope you guys have some ideas and/or tips. Trash Coders  Happy Holidays..
Post a Comment
Read more

Raising cryptography’s standards

Calculating encryption schemes’ theoretical security guarantees eases comparison, improvement. Most modern cryptographic schemes rely on computational complexity for their security. In principle, they can be cracked, but that would take a prohibitively long time, even with enormous computational resources. There is, however, another notion of security — information-theoretic security — which means that even an adversary with unbounded computational power could extract no useful information from an encrypted message. Cryptographic schemes that promise information-theoretical security have been devised, but they’re far too complicated to be practical. In a series of papers presented at the Allerton Conference on Communication, Control, and Computing, researchers at MIT and Maynooth University in Ireland have shown that existing, practical cryptographic schemes come with their own information-theoretic guarantees: Some of the data they encode can’t be extracted, even by a ...
Post a Comment
Read more