Exam2: Problem 6 Previous Problem Problem List Next Problem Consider the following two methods for producing a stream cipher. In one method we define the ith block of keystream as AES(r:) where k is a 128-bit key, ro = 1 and ri1 = ri +1. The counter variable r in this scheme is a 64 bit integer. In another method we define the ith block of keystream as AES (r;) where r; is the įth 64 bit integer yielded by a CSPRNG seeded with k. How long will it take before the first method repeats a keystream block? How long will it take, roughly, before the second method repeats a keystream block? If you had to use one of these exactly as described, which one would you choose?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please provide a relevant answer for the upvote, thank you in advance.

Exam2: Problem 6
Previous Problem
Problem List
Next Problem
Consider the following two methods for producing a stream cipher.
In one method we define the įth block of keystream as AES, (r;) where k is a 128-bit key, ro = 1 and r;11 = r; +1. The counter variable r in this scheme is a 64 bit integer.
In another method we define the ith block of keystream as AES (r;) where r; is the ith 64 bit integer yielded by a CSPRNG seeded with k.
How long will it take before the first method repeats a keystream block?
How long will it take, roughly, before the second method repeats a keystream block?
If you had to use one of these exactly as described, which one would you choose?
Preview My Answers
Submit Answers
You have attempted this problem 0 times.
You have unlimited attempts remaining.
Email instructor
Transcribed Image Text:Exam2: Problem 6 Previous Problem Problem List Next Problem Consider the following two methods for producing a stream cipher. In one method we define the įth block of keystream as AES, (r;) where k is a 128-bit key, ro = 1 and r;11 = r; +1. The counter variable r in this scheme is a 64 bit integer. In another method we define the ith block of keystream as AES (r;) where r; is the ith 64 bit integer yielded by a CSPRNG seeded with k. How long will it take before the first method repeats a keystream block? How long will it take, roughly, before the second method repeats a keystream block? If you had to use one of these exactly as described, which one would you choose? Preview My Answers Submit Answers You have attempted this problem 0 times. You have unlimited attempts remaining. Email instructor
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Hash Table
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education