import java.awt.Point; import java.util.Scanner; public class PlayfairCipher { //length of digraph array private int length = 0; //creates a matrix for Playfair cipher private String [][] table; //main() method to test Playfair method public static void main(String args[]) { PlayfairCipher pf = new PlayfairCipher(); } //main run of the program, Playfair method //constructor of the class private PlayfairCipher() { //prompts user for the keyword to use for encoding & creates tables System.out.print("Enter the key for playfair cipher: "); Scanner sc = new Scanner(System.in); String key = parseString(sc); while(key.equals("")) key = parseString(sc); table = this.cipherTable(key); //prompts user for message to be encoded System.out.print("Enter the plaintext to be encipher: "); //System.out.println("using the previously given keyword"); String input = parseString(sc); while(input.equals("")) input = parseString(sc); //encodes and then decodes the encoded message String output = cipher(input); String decodedOutput = decode(output); //output the results to user this.keyTable(table); this.printResults(output,decodedOutput); } //parses an input string to remove numbers, punctuation, //replaces any J's with I's and makes string all caps private String parseString(Scanner sc) { String parse = sc.nextLine(); //converts all the letters in upper case parse = parse.toUpperCase(); //the string to be substituted by space for each match (A to Z) parse = parse.replaceAll("[^A-Z]", ""); //replace the letter J by I parse = parse.replace("J", "I"); return parse; } //creates the cipher table based on some input string (already parsed) private String[][] cipherTable(String key) { //creates a matrix of 5*5 String[][] playfairTable = new String[5][5]; String keyString = key + "ABCDEFGHIKLMNOPQRSTUVWXYZ"; //fill string array with empty string for(int i = 0; i < 5; i++) for(int j = 0; j < 5; j++) playfairTable[i][j] = ""; for(int k = 0; k < keyString.length(); k++) { boolean repeat = false; boolean used = false; for(int i = 0; i < 5; i++) { for(int j = 0; j < 5; j++) { if(playfairTable[i][j].equals("" + keyString.charAt(k))) { repeat = true; } else if(playfairTable[i][j].equals("") && !repeat && !used) { playfairTable[i][j] = "" + keyString.charAt(k); used = true; } } } } return playfairTable; } //cipher: takes input (all upper-case), encodes it, and returns the output private String cipher(String in) { length = (int) in.length() / 2 + in.length() % 2; //insert x between double-letter digraphs & redefines "length" for(int i = 0; i < (length - 1); i++) { if(in.charAt(2 * i) == in.charAt(2 * i + 1)) { in = new StringBuffer(in).insert(2 * i + 1, 'X').toString(); length = (int) in.length() / 2 + in.length() % 2; } } //------------makes plaintext of even length-------------- //creates an array of digraphs String[] digraph = new String[length]; //loop iterates over the plaintext for(int j = 0; j < length ; j++) { //checks the plaintext is of even length or not if(j == (length - 1) && in.length() / 2 == (length - 1)) //if not addends X at the end of the plaintext in = in + "X"; digraph[j] = in.charAt(2 * j) +""+ in.charAt(2 * j + 1); } //encodes the digraphs and returns the output String out = ""; String[] encDigraphs = new String[length]; encDigraphs = encodeDigraph(digraph); for(int k = 0; k < length; k++) out = out + encDigraphs[k]; return out; } //---------------encryption logic----------------- //encodes the digraph input with the cipher's specifications private String[] encodeDigraph(String di[]) { String[] encipher = new String[length]; for(int i = 0; i < length; i++) { char a = di[i].charAt(0); char b = di[i].charAt(1); int r1 = (int) getPoint(a).getX(); int r2 = (int) getPoint(b).getX(); int c1 = (int) getPoint(a).getY(); int c2 = (int) getPoint(b).getY(); //executes if the letters of digraph appear in the same row //in such case shift columns to right if(r1 == r2) { c1 = (c1 + 1) % 5; c2 = (c2 + 1) % 5; } //executes if the letters of digraph appear in the same column //in such case shift rows down else if(c1 == c2) { r1 = (r1 + 1) % 5; r2 = (r2 + 1) % 5; } //executes if the letters of digraph appear in the different row and different column //in such case swap the first column with the second column else { int temp = c1; c1 = c2; c2 = temp; } //performs the table look-up and puts those values into the encoded array encipher[i] = table[r1][c1] + "" + table[r2][c2]; } return encipher; } // decodes the output given from the cipher and decode methods (opp. of encoding process) private String decode(String out) { String decoded = ""; for(int i = 0; i < out.length() / 2; i++) { char a = out.charAt(2*i); char b = out.charAt(2*i+1); int r1 = (int) getPoint(a).getX(); int r2 = (int) getPoint(b).getX(); int c1 = (int) getPoint(a).getY(); int c2 = (int) getPoint(b).getY(); if(r1 == r2) { c1 = (c1 + 4) % 5; c2 = (c2 + 4) % 5; } else if(c1 == c2) { r1 = (r1 + 4) % 5; r2 = (r2 + 4) % 5; } else { //swapping logic int temp = c1; c1 = c2; c2 = temp; } decoded = decoded + table[r1][c1] + table[r2][c2]; } //returns the decoded message return decoded; } // returns a point containing the row and column of the letter private Point getPoint(char c) { Point pt = new Point(0,0); for(int i = 0; i < 5; i++) for(int j = 0; j < 5; j++) if(c == table[i][j].charAt(0)) pt = new Point(i,j); return pt; } //function prints the key-table in matrix form for playfair cipher private void keyTable(String[][] printTable) { System.out.println("Playfair Cipher Key Matrix: "); System.out.println(); //loop iterates for rows for(int i = 0; i < 5; i++) { //loop iterates for column for(int j = 0; j < 5; j++) { //prints the key-table in matrix form System.out.print(printTable[i][j]+" "); } System.out.println(); } System.out.println(); } //method that prints all the results private void printResults(String encipher, String dec) { System.out.print("Encrypted Message: "); //prints the encrypted message System.out.println(encipher); System.out.println(); System.out.print("Decrypted Message: "); //prints the decryted message System.out.println(dec); } }
Write, Run & Share Java code online using OneCompiler's Java online compiler for free. It's one of the robust, feature-rich online compilers for Java language, running the Java LTS version 17. Getting started with the OneCompiler's Java editor is easy and fast. The editor shows sample boilerplate code when you choose language as Java and start coding.
OneCompiler's Java online editor supports stdin and users can give inputs to the programs using the STDIN textbox under the I/O tab. Using Scanner class in Java program, you can read the inputs. Following is a sample program that shows reading STDIN ( A string in this case ).
import java.util.Scanner;
class Input {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("Enter your name: ");
String inp = input.next();
System.out.println("Hello, " + inp);
}
}
OneCompiler supports Gradle for dependency management. Users can add dependencies in the build.gradle
file and use them in their programs. When you add the dependencies for the first time, the first run might be a little slow as we download the dependencies, but the subsequent runs will be faster. Following sample Gradle configuration shows how to add dependencies
apply plugin:'application'
mainClassName = 'HelloWorld'
run { standardInput = System.in }
sourceSets { main { java { srcDir './' } } }
repositories {
jcenter()
}
dependencies {
// add dependencies here as below
implementation group: 'org.apache.commons', name: 'commons-lang3', version: '3.9'
}
Java is a very popular general-purpose programming language, it is class-based and object-oriented. Java was developed by James Gosling at Sun Microsystems ( later acquired by Oracle) the initial release of Java was in 1995. Java 17 is the latest long-term supported version (LTS). As of today, Java is the world's number one server programming language with a 12 million developer community, 5 million students studying worldwide and it's #1 choice for the cloud development.
short x = 999; // -32768 to 32767
int x = 99999; // -2147483648 to 2147483647
long x = 99999999999L; // -9223372036854775808 to 9223372036854775807
float x = 1.2;
double x = 99.99d;
byte x = 99; // -128 to 127
char x = 'A';
boolean x = true;
When ever you want to perform a set of operations based on a condition If-Else is used.
if(conditional-expression) {
// code
} else {
// code
}
Example:
int i = 10;
if(i % 2 == 0) {
System.out.println("i is even number");
} else {
System.out.println("i is odd number");
}
Switch is an alternative to If-Else-If ladder and to select one among many blocks of code.
switch(<conditional-expression>) {
case value1:
// code
break; // optional
case value2:
// code
break; // optional
...
default:
//code to be executed when all the above cases are not matched;
}
For loop is used to iterate a set of statements based on a condition. Usually for loop is preferred when number of iterations is known in advance.
for(Initialization; Condition; Increment/decrement){
//code
}
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while(<condition>){
// code
}
Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.
do {
// code
} while (<condition>);
Class is the blueprint of an object, which is also referred as user-defined data type with variables and functions. Object is a basic unit in OOP, and is an instance of the class.
class
keyword is required to create a class.
class Mobile {
public: // access specifier which specifies that accessibility of class members
string name; // string variable (attribute)
int price; // int variable (attribute)
};
Mobile m1 = new Mobile();
public class Greeting {
static void hello() {
System.out.println("Hello.. Happy learning!");
}
public static void main(String[] args) {
hello();
}
}
Collection is a group of objects which can be represented as a single unit. Collections are introduced to bring a unified common interface to all the objects.
Collection Framework was introduced since JDK 1.2 which is used to represent and manage Collections and it contains:
This framework also defines map interfaces and several classes in addition to Collections.
Collection | Description |
---|---|
Set | Set is a collection of elements which can not contain duplicate values. Set is implemented in HashSets, LinkedHashSets, TreeSet etc |
List | List is a ordered collection of elements which can have duplicates. Lists are classified into ArrayList, LinkedList, Vectors |
Queue | FIFO approach, while instantiating Queue interface you can either choose LinkedList or PriorityQueue. |
Deque | Deque(Double Ended Queue) is used to add or remove elements from both the ends of the Queue(both head and tail) |
Map | Map contains key-values pairs which don't have any duplicates. Map is implemented in HashMap, TreeMap etc. |