Cryptompress: A Symmetric Cryptography algorithm to deny Bruteforce Attack
Vivek Kumar, Sandeep Sharma

TL;DR
Cryptompress is a novel 128-bit symmetric encryption algorithm that dynamically increases key size and alters ciphertext to resist brute-force attacks, utilizing a Feistel network and specialized matrix transformations.
Contribution
It introduces a dynamic key size increment and a unique matrix-based ciphertext formation to enhance security against brute-force attacks.
Findings
Successfully increases key size after failed attempts
Employs a Feistel network for encryption process
Produces ciphertext through matrix transformations
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Chaos-based Image/Signal Encryption · Coding theory and cryptography
