Explaining simple symmetric encryption algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM1355789

Q1) Consider a simple symmetric encryption algorithm as follows:

1- Input text T and 64 bit key K

2- Divide T into 64 bit size blocks B1...Bn

3- Get first block B1 and perform bit-wise XOR with K to produce encrypted block E1

4- Repeat

a. Get next block Bi and perform bit-wise XOR with Ei-1 to produce encrypted block Ei

5- Until End of Text. The algorithm is very simple, and naturally, we do not expect the cyphertext to be cryptographically strong. Given the above algorithm answer the following:

(a) Is it a problem if the first block of input happens to be the same as the key? Explain why?

(b) Modify the algorithm to rectify the above problem.

Reference no: EM1355789

Questions Cloud

Informed consent and counsellor : What must be included in an informed consent form ethically? Why are counsellors required to have a written informed consent form? In what ways are both the counsellor and the client being protected by such a document?
Eight steps for accounting cycle : What are the eight steps in the accounting cycle and how do they affect the financial statements? What happens if one is missing?
Pension expense-journal entries : Compute pension expense and prepare the journal entry to record pension expense and the employer's contribution to the pension plan in 2010.
Compute the degree of financial leverage : Make a common size income statement for Dreamscape, Corporation for the year ended December 31, 2005. Evaluate the company's performance against industry average ratios and against last year's results.
Explaining simple symmetric encryption algorithm : Consider a simple symmetric encryption algorithm as follows:Is it a problem if the first block of input happens to be the same as the key? Explain why?
How much work has the electric field done on proton : In a head on collision, a car stops in .10 seconds from a speed of 14 meters per second. The driver has a mass of 70 kg, and is, fortunately, tightly strapped into his seat. What force is applied to driver by his seat belt during that fraction of ..
Accounts receivable-bad debt journal entries : Prepare example journal entries to account for transactions related to accounts receivable and bad debt using both percentage of sales and the percentage of receivables methods.
Illustrate what recieves goverment subsides : Illustrate what recieves goverment subsides that are in place to protect the population rather than for economic reasons.
Right of access to files : What should clients be told with respect to their right of access to files? Describe a counselling situation in which such rights might come into play. One reference of a valid article.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Algorithm to divide sixteen digit value by six digit integer

Divide 16 digit value N by six digit integer D obtaining quotient Q and remainder (or sign of the remainder) R by division algorithms.

  Survey of fault tolerance policy for load balancing scheme o

This paper investigates about fault-tolerance in load balancing schemes in distributed environment. There are some more parameters influencing QOS but our main focus is on fault tolerance and load balancing.

  Algorithm to concatenate string in single binary search tree

Create algorithm which concatenates T1 and T2 into single binary search tree. Worst case running time must be O(h).

  Data structures and algorithms

Provides learners with an understanding of how data structures are used in algorithms and enables them to design and implement data structures

  Implement iterative version of algorithm heapify

Using any programming language to implement iterative version of algorithm HEAPIFY. Show your algorithm by running it on the array that contain your name characters.

  Computing randomized quick sort-s running time

Suppose that all element values are equal. What would be randomized quick sort's running time in this case? Each element of A[p .. q-1] is less than A[q], and each element of A[t+1 .. r] is greater than A[q]

  Method singleparent returns number of nodes in binary tree

Write a method singleParent, which returns number of nodes in a binary tree that have only one child.

  Determine computational complexity of algorithm

Describe the algorithm in psuedo-code. You should give thought to what data structures(s) make sense for e client implementation. Determine computational complexity of your algorithm.

  Algorithm for string of numbers recognize all the substrings

Write down algorithm, using pseudocode, to perform the following task, Given a string of numbers, recognize all of the substrings that form numbers that are divisible by 3.

  Generalize 2-3 algorithms for insert and delete

Generalize the 2-3 algorithms for INSERT and DELETE to K-J trees, where non-leaf vertices have between K and J children for fixed integers K >=2, and J>= 2K-1.

  Computing entropy of plaintext message

Compute the entropy of the plaintext message?

  Polynomial time algorithm for rooted directed acyclic graphs

Illustrate that if you were given a polynomial time algorithm for determining whether two rooted directed acyclic graphs are isomorphic, then polynomial time algorithm for testing.

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