This is the normal way of using stream ciphers. You create a pseudo-random keystream somehow, same number of keys in the keystream as there are characters (bytes) in the plaintext message, then XOR each individual key with its corresponding plaintext character, and that creates the ciphertext. So why 114 bits? Because the plaintext message consisted of 114 bits. And when you use XOR, the ciphertext is the same length as the plaintext. You could use other operations, say multiplication, and end up with longer ciphertext than plaintext.

Take a look at this presentation:

http://csrc.nist.gov/groups/ST/CETA_2011/presentations/turan.pdf

As a matter of fact, using XOR in that last step is also the case if you're using a block cipher in counter mode. See RFC 3686, Section 2.1.

http://www.rfc-editor.org/rfc/rfc3686.txt

The two techniques are ultimately quite similar, in my opinion.

Thanks Albert Manfredi

I fully agree with Albert

Thank you Abdeldime Mohamed Salih Abdelgader

can you improve XOR best compare OR , AND mathmatically ?

and is it a good case when the ciphertext is the same length as the plaintext as you Know there is attack and in this case there is weaknesses (vulnerabilities) from a point of my view ?

I appreciate your answer and help ..

Best Regards..