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.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Key Distribution Using Chaos Synchronization

  • Yuncai Wang

摘要

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.