Caesar cipher, C/C++ Programming

Assignment Help:

This task involves char arrays and pointer based string handling. Which we use to make a simple encryption program, using a Caesar Cipher,

Write a program that:

a. Asks the user to input a line of test

i. Converts this text so it is suitable for encryption

1. Converted to all be in lower case

2. Remove all non-letter characters

ii. This is the plain text.

b. Calls a function getLength which:

i. Takes one argument - the input string

ii. Returns the length of the string (excluding the NULL terminator)

c. Prints the length of the input string

d. Ask the user for the shift value.

e. Call a function makeCypher which:

i. Takes the shift value as an argument

ii. Returns the "Ciphertext alphabet" based on that keyword

f. Calls a function encrypt which

i. Takes two arguments

1. The input string

2. The "Ciphertext alphabet"

3. The "Group Count"

ii. Returns the input string suitably encrypted with the code and in set of characters "Group Count" long with any leftover spaces filled with random characters


Related Discussions:- Caesar cipher

What are user defined data types, Q: What are User Defined data types? ...

Q: What are User Defined data types? C supports an extraordinary feature known as "type definition" that permits users to define an identifier that would represent an existing

Program to display the greatest common divisor , Many modern cryptography a...

Many modern cryptography algorithms require two numbers that are coprime, or sometimes referred to as relatively prime. Two numbers are coprime if their greatest common divisor is

Chelo, need some help with finishing a program

need some help with finishing a program

#Padovan string, A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of the c

Computes the ackermann-peter a m-n function, (a) Write a procedure that com...

(a) Write a procedure that computes the Ackermann-Peter a(m,n) function. (b) Write a helper procedure that only allows the calculation of the Ackermann-Peter function for 0≤m

What is some instance of operator overloading?, A: Here are a few of the ma...

A: Here are a few of the many instance of operator overloading: myString + yourString may concatenate two std::string objects myDate++ may increment a Date object a * b may m

Palindrome, A palindrome is a string that reads the same from both the ends...

A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome

String function examples, 1. De ne a function chomp :: String -> String tha...

1. De ne a function chomp :: String -> String that selects a run of repeated characters from the start of a string with the run being as long as possible. For example ch

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd