Score:0

Can a security parameter be used in a function that combines pseudorandom generators?

us flag

I am really stuck with the following question:

$G: \{0,1\}^\lambda \to \{0,1\}^{2\lambda}$ is a secure pseudorandom generator, and $\lambda$ is a security parameter.

Is the following a secure pseudorandom generator? $$G'(s_1,s_2) = (s_1 \oplus 1^\lambda, G(s_1))$$

What confuses me about this is the use of the security parameter in the $G'$ function. Can the security parameter be used in this way? If yes, how can I go by determining if $G'$ is secure?

us flag
Thank you! And if you XOR s1 with all 1's, it should not make H any less secure, right? Do you understand what it means here that s2 is not present in (1⊕1,(1))?
kelalaka avatar
in flag
It means all 1's of size $\lambda$. Complement $s_1 \oplus 1^\lambda$ then check that second component is $G(s_1)$. It discards the input. It can still be expanding, though. I've changed $G$ and $G'$ as this more common notation ( $G$ from Generator). You can use $\LaTeX$/MathJax in the questions, answers, and comments, too. See my edits.
meshcollider avatar
gb flag
Remember that the security of a pseudo-random number generator considers whether you can tell the output apart from truely random. That should be sufficient info to complete the question :)
kelalaka avatar
in flag
Nina, you can write your answer, we will be happy about this. This will increase your skill since we will argue and correct your answer.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.