Question

Suppose that the keystream generated by a stream cipher is predictable in the sense that if...

Suppose that the keystream generated by a stream cipher is predictable in the sense that if you are given n keystream bits, you can determine all subsequent keystream bits. Is this a practical security concern? Why or why not?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Yes it is definitely a security concern,

  • Let us assume there is a database that stores secret user information, like medical, payroll or even criminal records. As a security measure to protect that information, the server that handles it encrypts it using a stream cipher. For now, we’ll assume that that server is secure, and there’s no way to get it to leak the key.
  • A Hacker gets a hold of all of the rows in the database. Perhaps he did it through a SQL injection attack, or maybe with a little social engineering by tricking people into things they shouldn’t be doing, like giving out secret keys, or performing certain operations. It’s usually the most effective way to break otherwise secure cryptosystems. Everything is supposed to remain secure: A Hacker only has the ciphertexts, but he doesn’t have the secret key.
  • If hacker can predict the key stream generated by the Cipher, then the entire DB is in the mercy of Hacker. He can delete all the criminal records, he can modify the records. Simply he can do whatever he wants with the secret information he wants.
  • Hence Predictable key stream is a security concern.
Add a comment
Know the answer?
Add Answer to:
Suppose that the keystream generated by a stream cipher is predictable in the sense that if...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Suppose you have a true random bit generated where each bit in the generated stream has...

    Suppose you have a true random bit generated where each bit in the generated stream has the same probability of being a 0 or 1 as any other bit in the stream and that the bits are not correlated; that is the bits are generated from identical independent distribution. However, the bit stream is biased.

  • Write a program that implements an elementary bit stream cipher. An elementary level bit stream cipher...

    Write a program that implements an elementary bit stream cipher. An elementary level bit stream cipher is an encryption algorithm that encrypts 1 byte of plain text at a time. This one uses a given 4-bit bit pattern as the key. The size of the encrypted message that we want to be able to send has a maximum length of 200 characters. You must: 1. prompt the user to input the clear text to be encrypted. You must use printf()...

  • 12. Suppose you haven video streams that need to be sent, one after another, over a...

    12. Suppose you haven video streams that need to be sent, one after another, over a communication link. Streami consists of a total of b, bits that need to be sent, at a constant rate, over a period of t seconds. You cannot send two streams at the same time, so you need to determine a schedule for the streams: an order in which to send them. Whichever order you choose, there cannot be any delays between the end of...

  • 1. Consider a cipher with three keys, three plaintexts, and four ciphertexts, given by: C2 CA...

    1. Consider a cipher with three keys, three plaintexts, and four ciphertexts, given by: C2 CA C C C3 C2 C4 C3 Ci m1 | 12 | 13 ki k2 ks Suppose all keys are equally likely, and the messages have probability P(mı) = 1/5, P(m2) 2/5, P(m3) = 2/5. (a) What is the probability of each ciphertext? (b) Compute P(q|m), Pq|m2), P(q|m3). Can you tell if the ciphertext has perfect secrecy from this calculation? (c) Compute P(ca|mı), P(c3|mı), P(ca|mı)....

  • 7.31. Suppose that we have used the Parks-McClellan algorithm to design a causal FIR linear phase...

    7.31. Suppose that we have used the Parks-McClellan algorithm to design a causal FIR linear phase lowpass filter. The system function of this system is denoted H(z). The length of the impulse response is 25 samples, i.e., h[n] 0 for n < 0 and for n > 24, and hol?0. The desired response and weighting function used were In each case below, determine whether the statement is true or false or that insufficient information is given. Justify your conclusions. (a)...

  • **DO IT AS PYTHON PLEASE** The Trifid Cipher General Problem Description The Trifid cipher (not to be confused with the...

    **DO IT AS PYTHON PLEASE** The Trifid Cipher General Problem Description The Trifid cipher (not to be confused with the creatures from the classic science-fiction film "The Day of the Triffids") is an algorithm that enciphers a plaintext message by encoding each letter as a three-digit number and then breaking up and rearranging the digits from each letter's encoded form. For this assignment, you will create a set of Python functions that can encode messages using this cipher (these functions...

  • APT. Suppose that stock returns are generated from the following linear process: ri = E(ri) +...

    APT. Suppose that stock returns are generated from the following linear process: ri = E(ri) + bi,1X1 + bi,2X2 + εi where εi and Xk are mean zero processses. The assumptions of Ross’ Arbitrage Pricing Theory hold. Consider three broadly diversified portfolios. Their returns are given approximately1 by rA =0.06+2X1 +2X2 rB =0.05+3X1 +X2 rC =0.03+3X1 (a) Suppose there is a risk-free asset in the economy. What is its return? 
 (b) Determine the factor risk premia. 
 (c) Consider a fourth...

  • Suppose 6 numbers are generated by a computer, each uniform on the interval (0, 1). Let...

    Suppose 6 numbers are generated by a computer, each uniform on the interval (0, 1). Let Y be the random variable representing the smallest of the numbers. (a) Show that the probability density of Y is given by py (t) -61-t)5, 0t <1 [51 Hint: The probability density for the r-th largest random variable can be derived using the Beta distribution by letting a = r and ?-n-r +1. (b) What is the probability that the smallest number is less...

  • Using C++ Part C: Implement the modified Caesar cipher Objective: The goal of part C is...

    Using C++ Part C: Implement the modified Caesar cipher Objective: The goal of part C is to create a program to encode files and strings using the caesar cipher encoding method. Information about the caesar method can be found at http://www.braingle.com/brainteasers/codes/caesar.php.   Note: the standard caesar cipher uses an offset of 3. We are going to use a user supplied string to calculate an offset. See below for details on how to calculate this offset from this string. First open caesar.cpp...

  • The heavier component has to be removed from a gas stream by absorption. The absorption column...

    The heavier component has to be removed from a gas stream by absorption. The absorption column operates at 2 550 kPa. The entering liquid is high molecular mass oil which contains 0.45% of the heaviest component but none of the lighter components. The total molar flowrate of the oil entering the absorber is 150 kmol/hr. The effluent gas that enters the absorber at 800 kmolhr contains 20 mol% C, 46 mol% C2, 30 mol% C3, 4 mol% n-C4. There are...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT