I am experiencing confusion regarding one-time pads. I have read that a one-time pad generates a key that has the same length as the plaintext. This is considered to be an overhead in sharing such a large key. So how could a pseudo-random key eliminate this overhead?
I have read of communication parties sharing a short seed which is then used to create a pseudo random key, and I am having trouble relating these two approaches.