Cryptompress: A Symmetric Cryptography algorithm to deny Bruteforce Attack
This addresses security vulnerabilities in encryption for users needing protection against brute-force methods, but it appears incremental as it builds on existing Feistel network concepts.
The authors tackled the problem of brute-force attacks in cryptography by proposing Cryptompress, a symmetric algorithm that increases key size by 32 bits on each unsuccessful attempt, resulting in enhanced security against such attacks.
Cryptompress, a new 128-bit (initial) private-key cryptography algorithm is proposed. It uses a block size of at least 30 bits and increments prior key size to additional 32 bits on each unsuccessful attempt of any means, including bruteforcing, further changing a specific portion of the cyphertext using the reformed Feistel network. Encryption process results from a proposed compression sequence developed using lookup table and shift operations followed by key generation. Eventually, four matrixes named add-sub matrix, reduced matrix, sequence matrix and term matrix are obtained which ultimately forms a cyphertext.