Propose a key generation program 1. nonsense ...
2. Title: The stereo people have a positive attack (decipherous, do not contain destruction) for ciphertext, using computer powerful computing and search capabilities, leaving this, is unimaginable, based on this point Trying to establish a key scheme based on a symmetric key to grab the computing and search capabilities to achieve ciphertext.
3. Decliminated: 1. There is almost no mathematical theory support in this article, so there is no strictness. 2. The proposed is only a contour, not (or impossible) details. 3. The purpose is only for everyone discussion .4. Specific content: The decimal digital sequence generated by a certain expression or equation f (X) (called: 1 key) is a key (referred to as: a secondary key) such as SQRT (2) = 1.4121. Of course, f (x) is complicated than SQRT (2) and is not common. Because the current computer is a map foreground model, it cannot be as understood, that is, it cannot be programmed for computational expressions! Any possible F (x) in the key space must be manually programmed and analyzed by computer. This enables the purpose of suppressing computer specialty. (I can think of the positive deciphering method of this key only) f (x) If you know other methods, you can give additional deciphering methods). The following assumptions are the main content for everyone to discuss and ask for advice 1. The primary key that can be selected is more uniformly distributed in a sufficiently large key space (key space by f (x) form and its constant parameters Determine what to imagine, 1 hypothesis should not be too much).
2. As a "unreasonable number of sequences" "general" has sufficient randomness (such as SQRT (2) = 1.1412 ..., please advise this.
3. Extremely unidirectional, such as a second-level key leak, a sequence is 31415926 Can you determine that the first-level key I use is PI? In fact, there is a number of unreasonable numbers containing the sequence (I call it local invalidation, I believe this hypothesis is reliable)
4. Currently in algorithm and hardware in the algorithm and hardware before or after still not long ago ------------------------------------------------------------------------------------------------------- -------------------- | Failure | | "必 之 路" | {either possible f (x)} ------------ -> {Artificial Programming} ------> {Computation Analysis} ...............> {Success}
Achieve the above probe whether it is impossible to decipher it under 1 assumption. The longer the stream password key random sequence cycle is, the shorter for key management, the better this is a pair of contradictions. The secondary key random sequence sequence cycle mentioned in this article is infinite. The substantive key, i.e., the length of F (X) is very short, thus balancing the above contradictions. If the computing power is allowed, the used sequence can be discarded, and the next encrypted sequence is implemented. One secret. . .
Disadvantages: Symmetric private key has the shortcomings. Universality is poor, high requirements, key may be provided by a professional third party. . . . . . (Finish).
