Ask Question, Ask an Expert

+61-413 786 465

info@mywordsolution.com

Ask Automata & Computation Expert

Cryptography and Data Protection

Part I

Q1 a Complete the following Truth Table: F denotes false and T denotes true

A

B

C=A or B

D= A xor B

E= A and B

F

F

 

 

 

F

T

 

 

 

T

T

 

 

 

T

F

 

 

 

Q1 b In the following Θ denotes one of the following operators: 'or', ‘xor' or ‘and'.

Input1 Θ input2 = Result where, input1 and,Inpuut2 are ‘A' and ‘B' and Result is one of C, D, or E.

Which operation will yield? (what is Θ?)
input1 (2) Θ result = input 2(1)

Q2 Using the English alphabet (i.e., mod 26 arithmetic) let plaintext = {p1, p2, pn} and corresponding cipher text = {c1, c2, cn}.
Suppose the encryption function is ci = pi + 10 (mod 26). You receive the cipher text message EWEM SC K QBOKD CMRYYV

What are the decryption function, and the decrypted/recovered plaintext? What type of cipher is this? Show your steps.

Q3 You are Alice. You have agreed with your friend Bob that you will use the Diffie-Hellman public-key algorithm to exchange secret keys. You and Bob have agreed to use the public base g = 7 and public modulus p = 1013.

You have secretly picked the value SA = 17. You begin the session by sending Bob your calculated value of TA. Bob responds by sending you the value TB = 839.

What is the value of your shared secret key? Can you guess Bob's secret value SB and what it would be? Show each and every step of your calculations

(for mod calculation, the following identity may be useful
mod( X^n, p) = mod (mod(X,p)*mod(X^n-1, p), p)
mod(X*Y,p) = mod(mod(X,p)*mod(Y,p),p)

Q4 Bob believes that he has come up with a nifty hash function. He assigns a numeric value VChar to each letter in the alphabet equal to the letter's position in the alphabet, i.e., VA = 1, VB = 2, ..., VZ = 26. For a message, he calculates the hash value H = (VChar 1 x VChar 2 x VChar 3 ...x VChar N) mod(26).
Bob uses this function to send a one-word message, GLARE, to his banker Bill, along with his calculated hash value for the message. Alice is able to intercept the message, and generates an alternative message that has a hash value that collides with Bob's original hash value.
Give definition and properties of the hash function.
Show a message that Alice may have used to spoof Bob's message, and demonstrate that its hash value collides with Bob's original hash.

Q5 Consider the following plaintext message: THE SIXTEENTH PRESIDENT WAS ABRAHAM LINCOLN.

a. If this message is sent unencrypted and successfully received, what is its entropy? And why?

b. If this message is encrypted with DES using a random 56-bit key, what is the encrypted message's entropy? And why

Part II

Essay Question: Length: 800- 900 words. Use APA format for in-line citations and references.

Compare and contrast symmetric and asymmetric encryption algorithms.

- Your response should include a brief overview of the cryptographic basis for each type of algorithm, and a comparison of their relative strengths and vulnerabilities.

- Describe how a hacker might go about cracking a message encrypted with each type of algorithm.

- Suggest a specific application for each type of algorithm (symmetric and asymmetric)where the advantages clearly outweigh the disadvantages.

- Remember to address all points

Automata & Computation, Computer Science

  • Category:- Automata & Computation
  • Reference No.:- M92760327
  • Price:- $45

Priced at Now at $45, Verified Solution

Have any Question?


Related Questions in Automata & Computation

Models of computation assignment -purpose - to improve and

Models of Computation Assignment - Purpose - To improve and consolidate your understanding of regular and context-free languages, finite-state and pushdown automata. To develop skills in analysis and formal reasoning abo ...

Prove or disprove the following proposed inference rules

Prove or disprove the following proposed inference rules for functional dependencies. A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules. A disproof ...

Regular expressions automatacomputabilitytheory of

Regular expressions, automata/computability/theory of computation How would I go about interpreting regular expressions? For example, how would I interpret the following in English: (0+1)*011 0*1*2* 0^(+)1^(+)2^(+)

Question - design a task or function that will check the

Question - Design a task or function that will check the parity of a word for odd parity. The input to the task/function is a 5-bit word called data_in. If the parity of input data_in is not odd increment an error count ...

Question 1hoare logic semantics for each of the parts below

Question 1 Hoare Logic Semantics For each of the parts below, justify your answer briefly. 1. For which programs S does {False} S {True} hold? 2. For which programs S does {True} S {False} hold? 3. For which programs S d ...

Question 1a digital computer has a memory unit with 16 bits

Question 1: A digital computer has a memory unit with 16 bits per word. The instruction set consists of 122 different operations. All instructions have an operation code part (opcode) and an address part (allowing for on ...

Question - design a state machine that will control a

Question - Design a state machine that will control a vending machine. The vending machine has 4 inputs, N, D indicating a nickel or dime was inserted as well as clk and an active high asynchronous reset. The vending mac ...

Models of computation assignment -purpose - to improve and

Models of Computation Assignment - Purpose - To improve and consolidate your understanding of regular and context-free languages, finite-state and pushdown automata. To develop skills in analysis and formal reasoning abo ...

Prove or disprove the following proposed inference rules

Prove or disprove the following proposed inference rules for functional dependencies. A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules. A disproof ...

Solve the question given belowprove the following statement

Solve the question given below Prove the following statement using Hall's Theorem. For any bipartite graph G=(U, V, E), if every node (either a left node or a right node) has exactly d neighbors, where d is an arbitrary ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Why might a bank avoid the use of interest rate swaps even

Why might a bank avoid the use of interest rate swaps, even when the institution is exposed to significant interest rate

Describe the difference between zero coupon bonds and

Describe the difference between zero coupon bonds and coupon bonds. Under what conditions will a coupon bond sell at a p

Compute the present value of an annuity of 880 per year

Compute the present value of an annuity of $ 880 per year for 16 years, given a discount rate of 6 percent per annum. As

Compute the present value of an 1150 payment made in ten

Compute the present value of an $1,150 payment made in ten years when the discount rate is 12 percent. (Do not round int

Compute the present value of an annuity of 699 per year

Compute the present value of an annuity of $ 699 per year for 19 years, given a discount rate of 6 percent per annum. As