The Blum-Blum-Shub generator produces pseudorandom bits as follows. We set a large natural M, set a...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
The Blum-Blum-Shub generator produces pseudorandom bits as follows. We set a large natural M, set a natural seed ro, and define ₁+1 for each i as r(modM). We let each pseudorandom bit bi be the lowest-order bit of x,. Most of the motivation for this generator is beyond us at this point, but we can explore the choice of M, borrowing some work from Chapter 3. (a) Show that at least some primes of the form 4n+1 (for example, try starting with 17) are bad choices for M. (b) Show that if M is a prime of the form 4n+3, and the seed is not 0, 1, or M-1, then the sequence of values z; has a period of 2n. (In particular, 22n+1 = 21.) We will need the fact from Section 3.9 that modulo any prime p, the ring Z, is cyclic, meaning there exists a generator g such that every nonzero element of the ring is some power of g. (c) In the original paper, they propose M to the product of two primes p = 4m +3 and q= 4n+3, each of the form 4n+3. What will be the period of the resulting generator? In particular, what if it is also true that q = 2p+1? The Hogwarts Quidditch League has four teams: Gryffindor, Hufflepuff, Ravenclaw, and Slytherin. In a given season there are six games, with each team playing each of the others once. Assume that a quidditch game cannot end in a tie and that each team is equally likely to win each game it plays. Using your favorite source of random bits (such as a coin, a stopwatch, or a computer), simulate ten full seasons of the league. (This might be by hand or by computer.) In how many seasons did one team finish undefeated? Calculate the probability that this happens, and compare this with your simulation. Consider the graph with a node for each five-letter English word, and an edge between two nodes if and only if their words differ in exactly one letter, such as moose and mouse. The five-letter edit game is to find a path in this graph from one word to another, or to find the shortest possible such path. Donald Knuth, in a computer search, found a path of length 20 from the word words to the word graph using only the 2000 most common five-letter English words. Can you duplicate this path, given the hint that the result of five edits from words is leapt, of ten edits is chose, and of fifteen edits is prone? The Blum-Blum-Shub generator produces pseudorandom bits as follows. We set a large natural M, set a natural seed ro, and define ₁+1 for each i as r(modM). We let each pseudorandom bit bi be the lowest-order bit of x,. Most of the motivation for this generator is beyond us at this point, but we can explore the choice of M, borrowing some work from Chapter 3. (a) Show that at least some primes of the form 4n+1 (for example, try starting with 17) are bad choices for M. (b) Show that if M is a prime of the form 4n+3, and the seed is not 0, 1, or M-1, then the sequence of values z; has a period of 2n. (In particular, 22n+1 = 21.) We will need the fact from Section 3.9 that modulo any prime p, the ring Z, is cyclic, meaning there exists a generator g such that every nonzero element of the ring is some power of g. (c) In the original paper, they propose M to the product of two primes p = 4m +3 and q= 4n+3, each of the form 4n+3. What will be the period of the resulting generator? In particular, what if it is also true that q = 2p+1? The Hogwarts Quidditch League has four teams: Gryffindor, Hufflepuff, Ravenclaw, and Slytherin. In a given season there are six games, with each team playing each of the others once. Assume that a quidditch game cannot end in a tie and that each team is equally likely to win each game it plays. Using your favorite source of random bits (such as a coin, a stopwatch, or a computer), simulate ten full seasons of the league. (This might be by hand or by computer.) In how many seasons did one team finish undefeated? Calculate the probability that this happens, and compare this with your simulation. Consider the graph with a node for each five-letter English word, and an edge between two nodes if and only if their words differ in exactly one letter, such as moose and mouse. The five-letter edit game is to find a path in this graph from one word to another, or to find the shortest possible such path. Donald Knuth, in a computer search, found a path of length 20 from the word words to the word graph using only the 2000 most common five-letter English words. Can you duplicate this path, given the hint that the result of five edits from words is leapt, of ten edits is chose, and of fifteen edits is prone?
Expert Answer:
Answer rating: 100% (QA)
Here are the steps to solve this problem a Primes of the form 4n1 are bad choices for M because for ... View the full answer
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date:
Students also viewed these accounting questions
-
Planning is one of the most important management functions in any business. A front office managers first step in planning should involve determine the departments goals. Planning also includes...
-
List three specific parts of the Case Guide, Objectives and Strategy Section (See below) that you had the most difficulty understanding. Describe your current understanding of these parts. Provide...
-
Write a literature review for your study. See below for an example of a literature review. Your literature review should provide both analysis and synthesis of previous studies as related to the...
-
Date 1 July 2019 1 June 2020 30 June 2020 1 July 2020 1 July 2020 30 June 2021 1 July 2021 Particulars (???) (???) (To record acquisition of delivery truck) (???) (???) (???) (To record minor repair...
-
Determine the surface area and volume of the wheel formed by revolving the cross-sectional area 360o about the zaxis. 1 in. 1 in. 15 in. 4 in.- 2 in.
-
Martha Stewart went to prison for selling nearly 4000 shares of ImClone Systems stock because she had inside information that the company was about to announce bad news that would result in the...
-
A delivery person in an elevator is holding a package by an elastic cord. (Don't ask why.) (a) What happens to the length of the cord when the elevator accelerates upward? Draw the free-body diagram...
-
A company is planning to invest $100,000 (before tax) in a personnel training program. The $100,000 outlay will be charged off as an expense by the firm this year (year 0). The returns from the...
-
Tommy started a business and paid $15,000 into the business bank account. Tommy also obtained a bank loan of $5,000 to help finance the business. How should be two transactions be classified in the...
-
The Hickory Cabinet and Furniture Company produces sofas, tables, and chairs at its plant in Greensboro, North Carolina. The plant uses three main resources to make furniturewood, upholstery, and...
-
During 2017, Lana Ltd commenced a research and development project on a promising new product. Lana Ltd prepares its financial statements annually on 30 June. The carrying amount of the deferred...
-
Instruction: Below, EXPLAIN how you can use the following " Concept " to solve the Organization "Problem, " described below. Make sure to take the reader through the logic of how they would implement...
-
In the context of distributed operating systems, what are the key design considerations and challenges associated with achieving efficient communication and synchronization among networked nodes?
-
An outline for your business type by identifying, describing and elaborating on 5 important policies (i.e. the ethical and legal policies and procedures) to include in a well-drafted Employee...
-
Response on how you feel about this opinion, agree or disagree with supporting points Transformational leadership and transactional leadership are very different from each other. They are different...
-
Response on how you feel about this opinion, agree or disagree with supporting points The difficulties women face attaining international assignments tend to come from legacy based biases that...
-
Anglo Co. Ltd has three production departments X, Y, Z and two departments A and B. The following estimated figures for a certain period have been made available: Rent and Rates Lighting and...
-
Determine by direct integration the values of x for the two volumes obtained by passing a vertical cutting plane through the given shape of Fig. 5.21. The cutting plane is parallel to the base of the...
-
Show that the problem of determining whether a boolean formula is a tautology is complete for co-NP.
-
What is the largest possible number of internal nodes in a red-black tree with black height k? What is the smallest possible number?
-
Show that any connected, undirected graph G = (V, E) satisfies |E| |V| 1.
-
In the Skycoaster amusement park ride, riders are suspended from a tower by a long cable. A second cable then lifts them until they reach the starting position indicated in Figure P5.3. The lifting...
-
Bethany, who weighs 560 N, lies in a hammock suspended by ropes tied to two trees. One rope makes an angle of 45 with the ground; the other makes an angle of 30. Find the tension in each of the ropes.
-
In the winter sport of curling, two teams alternate sliding 20 kg stones on an icy surface in an attempt to end up with the stone closest to the center of a target painted on the ice. During one...
Study smarter with the SolutionInn App