风语计算机：频率规范化，二进制编码系统和加密
Windtalking Computers: Frequency Normalization, Binary Coding Systems and Encryption
摘要：
本文讨论了应用已知的技术，知识和技术在一个新的加密方式。两个不同的和单独的方法。方法1：通过为频繁符号添加额外的冗余符号来改变语言的符号集。这将减少更常用符号的高频。因此，对密文的频率分析将是不可能的。因此，解密将是可能的。方法2：计算机使用二进制基数2。大多数加密系统使用加密将数据转换为密文。作者提出了一种计算机模拟说另一种语言的方法的理论和几种可能的实现。这是通过使用二进制基数而不是基数2来完成的。Ex. Fibonacci，Phi或Prime。此外，隐写术可用于创建替代二进制基。这种加密大大增加了解密的复杂性。首先，必须知道二进制基数。只有这样，解密才能开始。这种加密还打破了明文-码本-二进制的传递性;字母-ASCII-base 2的相关性。由于这种传递性被破坏，解密在逻辑上是不可能的。与加密明文相结合，二进制加密使解密无法破解。它可能会产生误报-信息理论安全，并且需要比目前使用的暴力解密更多的计算能力来解决。因此，断言这些方法的组合在计算上是安全的--不受蛮力的影响。所提议的系统有一个缺点。它不像base 2那样压缩。（类似于向加密添加随机填充。）然而，这是可以接受的，因为目标是非常强的加密：这两种方法都不是不可破解的方法-通过传统的统计方法。
英文摘要：
This paper discusses the application of known techniques, knowledge and technology in a novel way for encryption. Two distinct and separate methods are presented. Method 1: Alter the symbol set of the language by adding additional redundant symbols for frequent symbols. This will reduce the high frequency of more commonly used symbols. Hence, frequency analysis upon ciphertext will not be possible. Hence, decryption will be possible. Method 2: Computers use binary base 2. Most encryption systems use ciphering to convert data to ciphertext. The author presents the theory and several possible implementations of a method for computers analogous to speaking another language. This is done by using a binary base other than base 2. Ex. Fibonacci, Phi or Prime. In addition, steganography may be used for creating alternate binary bases. This kind of encryption significantly increases the complexity of decryption. First the binary base must be known. Only then, can decryption begin. This kind of encryption also breaks the transitivity of plaintext-codebook-binary; the correlation of letters-ASCII-base2. With this transitivity broken, decryption is logically impossible. Coupled with encrypting the plaintext, binary encryption makes decryption uncrackable. It may produce false positives--information theoretic secure, and requires much more computing power to resolve than is currently used in brute force decryption. Hence, the assertion that these combination of methods are computationally secure--impervious to brute force. The proposed system has a drawback. It is not as compressed as a base2. (Similar to adding random padding to the encryption.) However, this is acceptable, since the goal is very strong encryption: Both methods are not decryptable by method uncrackable - by conventional, statistical means.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
