Cryptography, Basic Computer Science

Assignment Help:
Assume |s1|=|s2|=n and consider the functions defined, for any s1 and s2, as:
(a) G1(s1,s2)=s1 xor s2, (b) G2(s1,s2)=(s1, s2, s1 xor s2).
We have that:

A.
G1 and G2 are pseudo-random generators because their outputs are uniformly (and thus, pseudo-randomly) distributed if so are their input

B.
G1 and G2 are not pseudo-random generators because either their outputs are not longer than their inputs or there exists a statistical test that distinguishes their outputs from a random string of the same length

C.
G1 and G2 are not pseudo-random generators because either there exists an efficient algorithm that can compute their input from their output or their outputs are not longer than their inputs

D.
G1 and G2 can be proved to be pseudo-random generators using a proof by reduction

Related Discussions:- Cryptography

Deadlocks, What is methods For handling Deadlocks?

What is methods For handling Deadlocks?

D, #questionWrite a program to find the area under the curve y = f(x) betwe...

#questionWrite a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two poi

Info Systems Management, Assignment 1: Project Management and Information ...

Assignment 1: Project Management and Information Security 2-3 page paper in which you: 1. Explicate in detail the importance of project management as it relate to an informatio

Explain code editor window and solution explorer, Question 1 Explain the c...

Question 1 Explain the components of the .NET Framework also give a diagram for this Question 2 Explain Code Editor Window and Solution Explorer Question 3 Write a

Concept of programming language, CONCEPT OF PROGRAMMING LANGUAGE: In o...

CONCEPT OF PROGRAMMING LANGUAGE: In order to communicate with other human beings, one needs some language or a medium. In the same way for solving problems, a programming  lan

Algorithms, 1. In each of the following situations, indicate whether f = O...

1. In each of the following situations, indicate whether f = O(g), or f = O(g), or both (in which case f = T(g)). Briefly explain why. (a) f(n)=10n5 +8n2,g(n)=20n4 +7n3 +300 (b) f

Deadlock , My question on the following link: http://www.3n33.com/upload/d...

My question on the following link: http://www.3n33.com/upload/download.php?img=1410

Characterizations of artificial intelligence, Characterizations of Artifici...

Characterizations of Artificial Intelligence Artificial Intelligence is a typical science to describe, because it has fuzzy borders with, psychology, computer science, mathemat

CS310, Ask question #Minimashdhdghfdgdfgdsgfdsgdsgdgdfgdgfdgdfgdfgdfsgfdsgd...

Ask question #Minimashdhdghfdgdfgdsgfdsgdsgdgdfgdgfdgdfgdfgdfsgfdsgdfsgum 100 words accepted#

Write Your Message!

Captcha
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