In cryptography, a caesar cipher is one of the simplest

 

Some encrypted text will be provided and your job is to write a C program to decrypt it. As always, the C program should be submitted as a standard C source code file. Please note that the computer program should comply with the commenting and formatting rules as described in class. For example, there should be a header for the whole program that gives the author’s name, class name, date, and description. End braces should be commented, and there are alignment and indenting requirements as discussed.

Basic Caesar Cipher –

In cryptography, a Caesar Cipher is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence. (https://en.wikipedia.org/wiki/Caesar_cipher).

In a Caesar Cipher, the encryption is performed against a key string, which is often just the 26 letters of the alphabet. An offset value is defined that consists of a positive or negative integer. The plaintext (the normal text) is encrypted, one letter at a time, by using that offset value in the following way: (a) the index position within the key string of the letter to be encrypted is determined, (b) the offset value is applied to that index in order to obtain a new index within the key string, (c) the character at the new index is written as the cipher text.

The basic Caesar Cipher has a characteristic that makes it relatively easy to break: every character in the plain text is encoded with the same character in the cipher text. In the above example, every space is encoded with an ‘E’. Since the space is the most commonly used character, an observant reader could assume that a space is represented by an ‘E’ and determine the offset from that.

A variation on the basic Caesar Cipher uses a variable offset, one that is different for each character encoded. In this algorithm, the first character of the plain text will be encoded by some firstOffset as above, the next character is encoded by (firstOffset+1), the next by (firstOffset+2), etc. As you can see, the offsets grow sequentially from the first character of the plain text to the last. This ensures that instances of a character in the plain text will be represented by different characters in the cipher text.

Here is the above string encoded with a sequential offset that begins with 5. Notice that the “I” is still encoded by “N”, but all of the other characters are different.

Plain text: I LOVE TO FLY

Cipher text: NFSWDOKEANUAO

Here the “I” is encoded with an offset of 5, yielding a cipher text character “N”. The first space is encoded with an offset of 6, yielding a cipher text character of “F”. The “L” is encoded with an offset of 7, yielding a cipher text character of “S”, and so forth. Each character is encoded by an offset 1 larger than the preceding character until the end of the plain text is reached. Let’s apply the modified Caesar Cipher described above to a more complicated example. What follows is the key string you can use to decrypt the cipher text.

Key String: “hXTFexn39AJ6cmCYgktNuUwBdlKL04R1DSQrH y5q8VpjIZMGivEfasoWOb72zP“

The only characters in the key string are lower case alpha characters, upper case alpha characters, digits from 0 to 9, and a space. Those characters have been jumbled up to make the problem more difficult. The double quotes are used to mark the end of the key string; they are not part of it. The cipher text that you need to decrypt against that key string is:

Ciper text: “Vs8dLIcPJuiEfFsyOA89JTIv06iFu5aSw O27L4pzkTAwkyEl”

Of necessity, all of the characters in the cipher text are contained in the key string. The sequential offset values used to encrypt the plain text are positive and can begin with any number between 1 and 60. (You should, therefore, apply negative sequential offsets to decrypt the cipher text.)

Assignment –

Your task is to determine the initial offset value that will correctly decrypt the cipher text above and apply the modified Caesar Cipher algorithm to it to decrypt the string. When you find the correct initial offset, you will be able to read the string. If you do what the decrypted string says, you can have 5 extra bonus points.

In order to determine the initial offset value, your program should calculate all possible initial offsets from 1 to 60. Your output should look like the following, where “Offset” means “Initial Offset”:

Cipher Text: “Vs8dLIcPJuiEfFsyOA89JTIv06iFu5aSw O27L4pzkTAwkyEl”

Offset: 1; Result: 8fyuw5xsXJy55f5wqswEfpwKFGwysAwXfFwdwfaFuyw0qQsF5

Offset: 2; Result: qE NUyeahA yyEyU5aUvEVUlTMU a9UhETUBUEfTN UL5SaTy

Offset: 3; Result: 5vHtu FfP9H v uyfuiv8udXZuHf3uPvXuwuvEXtHuKyDfX

Offset: 4; Result: yirkNHTEz3rHHiHN ENGiqNBhINrEnNzihNUNivhkrNl 1EhH

Offset: 5; Result: GQgtrXv2nQrrGrtHvtMG5twPjtQvxt2GPtutGiPgQtdHRvPr

Offset: 6; Result: ……

Remember that since the cipher text was encrypted with positive offsets, you will decrypt with negative offsets. These are actual data, so you can use these to check your program. After the full list is generated, you will be able to visually scan through it and determine the offset and the plain text.

Hints –

The following functions might be useful to your solution:

1. A function to determine the length of a C-string. Note that the ‘’ is not included in the length calculation.

a. int strlen(char *); (<string.h>)

2. A function to locate a character within a C-string and return its index value.

a. This function can be used to find a given character within the key string.

Finally, you can initialize a C-string with the key string and cipher text specified above by copy/pasting those strings into your code, but here is an important point: never copy/paste from a non-text file, like a PDF for example, directly into your code. Instead, copy/paste the text into Notepad or Notepad++ first, then copy/paste into your code. This eliminates most of the problems caused by hidden formatting characters and other issues.

Get 20% Discount on This Paper
Pages (550 words)
Approximate price: -

Try it now!

Get 20% Discount on This Paper

We'll send you the first draft for approval by at
Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

Our Services

Custom Writings Help is a Quality-Oriented Company in Online Writing as a result of hiring exceptional professionals to execute clients' tasks.

Essays

Research Papers

At Custom Writings Help,We understand the struggle of research paper writing, and that is why at Custom WritingS Help, we are all out to help you. We pride ourselves on having a team of clinical writers. The stringent and rigorous vetting process ensures that only the 'BEST' Writers are chosen for the job. We have highly qualified Ph.D. and MA writers working with us; we equally offer these experienced writers specific bonuses and incentives to make them deliver highly original, unique, and informative content at reasonably low prices.

Admissions

Thesis Writing Service

Worlwide, Many Masters Students are struggling with Thesis Completion. A thesis is likely to be the longest and most challenging piece of work a student has ever completed. However, unlike essays and other assignments, a student can pick a particular interest topic and work on their initiative. Fortunately, we are there for you. At Custom Writings Help, you are assured of an authentic, imaginative, informative, linguistically great, and advantageous thesis that adheres to all your needs. So, why continue considering different writers when you have discovered the best in the field?

Editing

Custom Papers

Not a single student can avoid writing custom papers. However, a total lack of experience, skills, and time makes it very hard to produce a superb writing piece. Therefore, if you are seeking professional help, turn to us. Our specialized and experienced writers compose a variety of model papers, including custom essays, college term papers, research papers, book reports, MBA essays, executive summaries, dissertations, Ph.D. theses, admission essays, and research proposals for college and university students at any level.

Coursework

Essay Writing

Most of the students disregard the critical principles of essay writing and compose papers below sensible guidelines. Therefore, with Custom Writings Help, one should not worry about his/her essay. Our Writers compose informative and engaging content on all complexities and topics. We write meaningful and smart essays while prioritizing all aspects that bring about a good grade, such as impeccable grammar, proper structure, zero-plagiarism, and conformance to guidelines.

Coursework

Coourse Work Writing

Don't let the seemingly never-ending onslaught of writing assignments get you down. If you are looking where to get course work assistance online, the writers at Custom Writings Help are here to assist you with all of your writing needs. We undertake to unique delivery of papers that meet the professor's requirements. The content is proofread, edited, and checked plagiarism before submission to customers. No matter how big or small your work is, we will deliver on time. Try US Now! !

Coursework

Dissertation Writing Service

High-Quality Dissertation Writing Services are rare. They require Ph.D. academicians – not easily found. However, are an exception. The years, time, and resources we have invested in the dissertation world has given us a competitive advantage over others. Choose to come to Custom Writings Help; You will find perfect Ph.D. consultants who have written hundreds of dissertations theses ready to help you. Let our dissertation-writing services help you craft your dissertation, for you are assured we will give you the results.