It was said earlier that the onetime pad is completely secure but that a large key must be created and stored. If the key is found then the security is compromised. Well, what if the actual key were generated as the text is encrypted? This could easily be done with a pseudo-random number generator. I am currently developing an algorithm called RKOPV that uses this.
The only way to cryptanalyze it would be to try every possible seed for the random number generatr, since the seed acts as the key. The larger the seed, the more difficult this is. If you have eight distinct seeds of 32 maximum bits each, then there are (2^32)^8 possible keys and even if every computer in the world were put to work checking each seed it would still take longer than the lifetime of the universe.
If anyone wants more info, please PM me. I am planning to release the exact algorithm to the public for free once my copyright and patent are secured.