Method and apparatus for generating a pseudo random number

1. A method, comprising:

generating a pseudo random number based on a set of stored pseudo random numbers, the stored pseudo random numbers corresponding with pseudo random numbers generated from a pseudo random number generation function indexed by orders of two.

2. The method of claim 1 , further comprising:

storing N pseudo random numbers, each of the stored N pseudo random numbers equals a pseudo random number generated from a pseudo random number generation function S(i), where i is the index of the pseudo random number generation function, and the stored N pseudo random numbers equal pseudo random numbers generated using indices i=2^n, where n=0 . . . N−1.

3. The method of claim 2 , wherein the storing step stores each of the N pseudo random numbers in a memory location.

4. The method of claim 2 , wherein the pseudo random number generation function S(i) equals v^i mod p, where v is a number less than p.

5. The method of claim 4 , further comprising:

generating a turbo interleaver address using the generated pseudo random number.

6. The method of claim 4 , wherein v is cipher text for encryption.

7. The method of claim 2 , wherein the generating step generates the pseudo random number based on the stored N pseudo random numbers and a binary index having N bits.

8. The method of claim 7 , wherein the generating step comprises:

selecting pseudo random number from the stored pseudo random numbers based on the binary index;

multiplying pseudo random numbers selected from the stored pseudo random numbers; and

performing a mod operation on a result of the multiplying step.

9. The method of claim 1 , wherein the generating step comprises:

multiplying pseudo random numbers selected from the stored pseudo random numbers; and

performing a mod p operation on a result of the multiplying step.

10. The method of claim 9 , wherein the generating step further comprises:

selecting the pseudo random numbers based on an index.

11. The method of claim 9 , wherein the performing step performs the mod p operation by selectively combining 2 i mod p values for i=0 to x−1, where x is greater than one.

12. The method of claim 11 , further comprising:

generating a 2 n mod p value based on a previously generated 2 n−1 mod p value, where n is greater than 1.

13. A method of storing pseudo random numbers indexed by orders of a first number in a memory, comprising:

generating pseudo random numbers corresponding with pseudo random numbers generated using the pseudo random number generation function indexed by orders of a first number based on a stored pseudo random number; and

storing the generated pseudo random numbers.

14. The method of claim 13 , wherein the generating step generates each successive pseudo random number, which is equal to a pseudo random number generated using the pseudo random number function indexed by a successive order of the first number, using the previously generated pseudo random number.

15. The method of claim 13 , wherein the pseudo random number generation function S(i) equals v^i mod p, v is a number less than p.

16. The method of claim 15 , wherein the generating step generates each successive pseudo random number, which is equal to a pseudo random number generated using the pseudo random number function indexed by a successive order of the first number, by squaring the previously generated pseudo random number and performing a mod p operation on a result of the squaring step.

17. The method of claim 15 , wherein the first number is two.

18. A method of populating a memory with 2 n mod p values, comprising:

generating a 2 n mod p value based on a previously generated 2 n−1 mod p value, where n is greater than 1; and

storing the generated 2 n mod p value.

19. An apparatus, comprising:

a memory storing pseudo random numbers equal to pseudo random numbers generated from a pseudo random number generation function indexed by orders of two; and

a selective combiner circuit generating a pseudo random number based on the stored pseudo random numbers.

20. An apparatus for populating a memory storing pseudo random numbers indexed by orders of a first number, comprising:

a memory storing a first pseudo random number equal to a pseudo random number generated from a pseudo random number generation function indexed by the first number; and

a generator circuit generating pseudo random numbers equal to pseudo random numbers generated using the pseudo random number generation function indexed by orders of the first number based on the stored first pseudo random number, and storing the generated pseudo random numbers in the memory.