Testing Perfect Secrecy using Shannon's Theorem

Is the following encryption scheme perfectly secure? You can observe as many encrypted text and key pairs as you wish. Press "Next Plaintext" method to get more pairs.

 Plaintext:
 11101010

 Key:
01010100

Ciphertext: 01010100

                    

For all the possible pairs of plaintext of size 8, and the key given by you, we will provide you with the encrypted texts with the same encryption scheme. You can observe the input and try to break it.
Put your key here (between size 6 and 12):

Multiple tuples of <Plaintext, Ciphertext>:

Is the given encryption scheme secure?

---

Yes/No

If NO, Give two plaintexts 'm1' and 'm2' for the above key such that Encryption(m1) = Encryption(m2)?

m1:

m2:

Simulator

---

plaintext
10010011000110

key =

Ciphertext