I understand that by definition one-time-pad keys cannot be reused but I was thinking about the case where it is used to send random data and couldn't find anything on the subject so here is my idea:
Sending y-bits of data using x-bits of random data as a key where y > x.
Step 1: Both parties agree on a x-bits key (With DH or a safe communication). EDIT: This is only so users can remotely agree on a key, they could also physically share a key.
Step 2: Either agree on a pseudo random data generator before hand or submit an array of random bits to the receiver(The size depends on the algorithm used on Step 4). EDIT: This data doesn't need to be a secret.
Step 3: I xor the bits generated on Step 2 with the key to get another random array.
Step 4: Use the result of Step 3 on a PRNG or hash function to add more security. Without this step a many-time-pad attack would be possible (Or "easy" at least).
Step 5: xor y with the data to be encrypted to obtain the cipher version.
With this, as long as the algorithm use in Step 4 is random the key can be reused without any worries. The only problem is that one could brute-force it. But since the key doesn't have a size limit all we would need to do is to use a key with a decent size (256 or 512 bits).
Could this be a replacement for AES? If I'm not mistaken only a brute force attack can find the plain-text without the key. Considering that Steps 2 & 4 add enough randomness.