# Tagged Questions

72 views

### Primitive polynomials in LFSRs

I need help proving the following theorem. I found it many books but on every single one it says that they omit the proof because it is in every good textbook. THM Let $c(x)$ be a connection ...
45 views

### determining the next random number pseudorandom number generator?

I have given 3 numbers let's say basic example x_0=5, x_1=6 and x_2=2 and modulus p is 7, ...
119 views

### How to create 2048 random bits from 256 bits?

Would merely repeating the same value 8 times be sufficient ? Or is there a more clever approach for doing this ? The 256 bit values would be generated from SHA256 of files.
121 views

### Question about the meaning of expression in cryptography

Let $G(x)$ be a pseudo-random generator such that: $G(x)$ = $f_x(0^k)f_x(1^k)$ where $k=|x|$. I don't understand the meaning of $1^n$, $0^n$ and the differences between them within that ...
200 views

### Expected number of tosses - coin tossing

I have here 2 methods for generating a random number, and I need to calculate the expected number of tosses for each method. In each, we let n = log(N) Ne be the bit-length of N and let ...
269 views

### non-overlapping template matching for bit sequences : why non-periodic templates?

To test a 'random' bit sequence for cryptographic strength I have been using the NIST's Non-overlapping Template Matching Test (See page 2-14 but I will explain here). This test uses a non-periodic ...
I find confusing some examples I have seen. Maybe you can help me to determine what is going on with them. A Generalized Feedback Shift Register (GFSR) sequence defines a sequence $\{W_{i}\}$ ...