`I am not a cyrptoanalyst, not a mathematicien. But, I wanted toenumerate some facts about "The Hohha Dynamic XOR Encryption"algorithm I mentioned earlier.My algorithm is "fundamentally different" from classical encryptionmethods, because, it dynamically "encrypts" the key itself "during asingle transaction"!"My Salt value" is a randomly choosen 4 bytes for every "transaction".My "salt" is neither salt,  nor IV nor "salt in hashing", nor "nonce"in cryptology, but a combination of all them.Because:The first jump position, depends on the salt value. Changing theinitial position of the encryption gives a "completely differentoutput"! This is a precaution against, chosen ciphertext attacks.Not finished!I XOR all bytes of salt value with 8Bit CRC, which give me a"completely different output" for a small change in key, as I am usingthose salt values for every byte to be encrypted. This is a precautionagainst "related key attacks"Changing the "salt value"(or call it nonce value if you prefer) of thealgorithm is not just a multiplication of possibilities by 255^4; but it also"completely" changes the result. Because, it "completely" changes thejump path!The algorithm is safe against: Cryptoanalysis like : Index ofcoincidence, Kasiski, Vigenere Cypher. Because, there is no "pattern".For example the most frequent letter "A", of Turkish alphabet will beencrpyted as different values each time.Most importantly; during a single transaction, the plaintext isencrypted with the key, meanwhile, the key itself is encrypted withthe plaintext. This avoids "chosen ciphertext" attack, "ciphertextonly attack" or  differential cryptoanalysis.Even if salting is not used, the algorithm guarantees us that it isimpossible to find out the key even if we have the cyphertext andplaintext. Because, "there will be a lack of information". Let's takethe trivial example: We do at least 2 jumps. So, we XOR the plaintextbyte with at least 2 numbers. In this case, even if we have theplaintext and the cyphertext, we may just obtain the XOR result of 2unknown values.RegardsIsmail KizirOn Wed, Nov 18, 2015 at 6:33 PM, Harald Arnesen <harald@skogtun.org> wrote:> Ismail Kizir [2015-11-18 06:25]:>>> Hello,>>>> I've developed a new encryption algorithm, which dynamically changes>> the key according to plaintext and practically impossible to break. I>> also opened to public with MIT&GPL dual License.>> "There are two kinds of cryptography in this world: cryptography that> will stop your kid sister from reading your files, and cryptography that> will stop major governments from reading your files."> - Bruce Scheier, Applied Cryptography> --> Hilsen Harald`