I'm implementing impossible differential cryptanalysis on 3.5 round IDEA using the methods in "Miss in the middle attack on IDEA and Khufu" paper.

In the first step I need to provide $2^{32}$ pairs that are identical in $X_2$ and $X_4$ and have all the possiblities in $X_1$ and $X_3$ to start the cryptanalysis.

So I've tried to collect the text for various books to provide the first plaintext and the second plaintext of the pair is computed so that it matchs the input difference of the pairs.

but all the text that I come up with is equivilant to only 2 million plaintexts so I'm repeating this for the rest of the pairs to reach $2^{32}$ pairs.

is this correct or should I have to get unique text for each pair and if that's what I should do where I could find these large texts?

I'm implementing impossible differential cryptanalysis on 3.5 round IDEA using the methods in "Miss in the middle attack on IDEA and Khufu" paper.

In the first step, I need to provide $2^{32}$ pairs that are identical in $X_2$ and $X_4$ and have all the possibilities in $X_1$ and $X_3$ to start the cryptanalysis.

So I've tried to collect the text for various books to provide the first plaintext and the second plaintext of the pair is computed so that it matches the input difference of the pairs.

But all the text that I come up with is equivalent to only 2 million plaintexts so I'm repeating this for the rest of the pairs to reach $2^{32}$ pairs.

Is this correct or should I have to get unique text for each pair and if that's what I should do where I could find these large texts?

I'm implementing impossible differential cryptanalysis on 3.5 round IDEA using the methods in "Miss in the middle attack on IDEA and Khufu" paper.

In the first step I need to provide 2^32 pairs that are identical in X2 and X4 and have all the possiblities in X1 and X3 to start the cryptanalysis.

So I've tried to collect the text for various books to provide the first plaintext and the second plaintext of the pair is computed so that it matchs the input difference of the pairs.

but all the text that I come up with is equivilant to only 2 million plaintexts so I'm repeating this for the rest of the pairs to reach 2^32 pairs.

is this correct or should I have to get unique text for each pair and if that's what I should do where I could find these large texts?

I'm implementing impossible differential cryptanalysis on 3.5 round IDEA using the methods in "Miss in the middle attack on IDEA and Khufu" paper.

In the first step I need to provide $2^{32}$ pairs that are identical in $X_2$ and $X_4$ and have all the possiblities in $X_1$ and $X_3$ to start the cryptanalysis.

So I've tried to collect the text for various books to provide the first plaintext and the second plaintext of the pair is computed so that it matchs the input difference of the pairs.

but all the text that I come up with is equivilant to only 2 million plaintexts so I'm repeating this for the rest of the pairs to reach $2^{32}$ pairs.

is this correct or should I have to get unique text for each pair and if that's what I should do where I could find these large texts?