pith. sign in

arxiv: 1604.02128 · v1 · pith:IL2E7JT6new · submitted 2016-04-07 · 💻 cs.CR

Cryptompress: A Symmetric Cryptography algorithm to deny Bruteforce Attack

classification 💻 cs.CR
keywords matrixalgorithmbitscryptographycryptompresscyphertextproposedsequence
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.