One Time Pad - does it work for long plain texts? Reading Dirk Rijmenants's work on One Time Pad and he frequently mentions that it is suited to short plaintexts. 

I presume this is just because of the practicality of encrypting and decrypting one time pad ciphers? If not why is it not mathematically appropriate for longer plaintexts 1000 characters plus? 

Presumably if the one time pad was longer and totally plaintext this cipher works with plaintexts of lengths through to infinity. 

Thanks for the help with this small point.
The one-time pad guarantees secrecy for messages of arbitrary length, assuming the key is uniformly random of (at least) the same length. There are no caveats to this information-theoretic theorem, it's just that securely exchanging big amounts of key material may be considered to be impractical in some scenarios.

(But frankly, nowadays you would just hand over an SD card or something and have enough key material for hundreds of gigabytes of messages. If you were to engage in that kind of activities rather than using a modern cipher, that is.)