Q:

How comparable is OFB to a one-time pad?

This is a rather trivial question, I just want to see if I get the concept right.
In OFB you generate a pseudorandom stream based on some nonce, and you XOR that with the message to get the ciphertext. This sounds a lot like a one-time pad but I don't see the parallelism anywhere in literature. Am I missing something?

A:

As @CodesInChaos said, OFB is a stream cipher.  The one-time pad is a stream cipher, too.  One difference is that the one-time pad is information-theoretically secure, while OFB is computationally secure.

