Playfair cipher Program plan: In the file “ PlayfairCipher.java ”, import necessary packages and create a class “ PlayfairCipher”, Declare a string variable, and a 2D array. Define the constructor to initialize the array. Define the method “processStream()” to process the contents of a stream. Define the method “process()” to process a stream. Define the method “makeEncryptionKey()” to make an encryption key. Define the method “found()” to determine if a character is found. In the file “ Encryptor.java ”, import necessary packages and create a class “ Encryptor”, Define the method “main()”, Initialize the necessary variables. Execute “try” statement, Initialize the variable. Execute “while” loop till the length of the argument, Check if the argument is “-k”, Increment the value by 1. Check the condition, If it is true, set the key. Otherwise, if the input file is null, Get the input file. Otherwise, if the output file is null, Get the output file. If either the input or output or key is null, Print the string. Otherwise, Create the input stream. Create the output stream. Create an object for “PlayfairCipher”. Call the method “processStream()”. Close the input and output file. Catch if exception occur, Handle the exception.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 4PP

Program Plan Intro

Playfair cipher

Program plan:

In the file “PlayfairCipher.java”, import necessary packages and create a class “PlayfairCipher”,

Declare a string variable, and a 2D array.

Define the constructor to initialize the array.

Define the method “processStream()” to process the contents of a stream.

Define the method “process()” to process a stream.

Define the method “makeEncryptionKey()” to make an encryption key.

Define the method “found()” to determine if a character is found.

In the file “Encryptor.java”, import necessary packages and create a class “Encryptor”,

Define the method “main()”,

Initialize the necessary variables.

Execute “try” statement,

Initialize the variable.

Execute “while” loop till the length of the argument,

Check if the argument is “-k”,

Increment the value by 1.

Check the condition,

If it is true, set the key.

Otherwise, if the input file is null,

Get the input file.

Otherwise, if the output file is null,

Get the output file.

If either the input or output or key is null,

Print the string.

Otherwise,

Create the input stream.

Create the output stream.

Create an object for “PlayfairCipher”.

Call the method “processStream()”.

Close the input and output file.

Catch if exception occur,

Handle the exception.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

[5 marks] Give a recursive definition for the language anb2n where n = 1, 2, 3, ... over the alphabet Ó={a, b}. 2) [12 marks] Consider the following languages over the alphabet ={a ,b}, (i) The language of all words that begin and end an a (ii) The language where every a in a word is immediately followed by at least one b. (a) Express each as a Regular Expression (b) Draw an FA for each language (c) For Language (i), draw a TG using at most 3 states (d) For Language (ii), construct a CFG.

Question 1 Generate a random sample of standard lognormal data (rlnorm()) for sample size n = 100. Construct histogram estimates of density for this sample using Sturges’ Rule, Scott’s Normal Reference Rule, and the FD Rule. Question 2 Construct a frequency polygon density estimate for the sample in Question 1, using bin width determined by Sturges’ Rule.

Generate a random sample of standard lognormal data (rlnorm()) for sample size n = 100. Construct histogram estimates of density for this sample using Sturges’ Rule, Scott’s Normal Reference Rule, and the FD Rule.