Have you read the Wikipedia article? It's not written for lay people but it's not bad. Using it you should be able to prove to yourself that if the key has less entropy than the message it's not possible to achieve this level of security. https://en.wikipedia.org/wiki/Information-theoretic_security
i'm not using any traditional math
That doesn't get you an out - the theorems don't care how you transform M to C.
right. but, again, the whole system doesn't even rely on entropy. i was referring to existing literature as an analogy to, perhaps, better clarify the idea. it seems i was mistaken doing so.
It might be an idea to read about different attacks - known plaintext etc - and seein if your system is still secure. (It won't be, so if you can't find the flaw you know you need to look more).
Comments
Have you read the Wikipedia article? It's not written for lay people but it's not bad. Using it you should be able to prove to yourself that if the key has less entropy than the message it's not possible to achieve this level of security. https://en.wikipedia.org/wiki/Information-theoretic_security
That doesn't get you an out - the theorems don't care how you transform M to C.
right. but, again, the whole system doesn't even rely on entropy. i was referring to existing literature as an analogy to, perhaps, better clarify the idea. it seems i was mistaken doing so.
The sci.crypt faq has more information. http://www.contrib.andrew.cmu.edu/~shadow/crypt.html
http://www.faqs.org/faqs/cryptography-faq/
It might be an idea to read about different attacks - known plaintext etc - and seein if your system is still secure. (It won't be, so if you can't find the flaw you know you need to look more).
thanks. looking into them ..