Key Distribution Using Chaos Synchronization
摘要
Claude Elwood Shannon has theoretically proven: if the keys are completely random, have the same length as the plaintext, and are used only once, then the encryption is unbreakable as long as the key distribution is secure. It is evident that the key distribution is the most important aspect of secure communication.