Proposing A Symmetric Key Bit-Level Block Cipher
Sarbajit Manna, Saurabh Dutta

TL;DR
This paper introduces a new symmetric key bit-level block cipher using G.C.D, which dynamically generates keys, compresses data by 50%, and enhances security for various file types.
Contribution
It presents a novel G.C.D-based bit-level block cipher with dynamic key generation and data compression, improving security and efficiency over existing methods.
Findings
Achieves 50% compression rate in ciphertext
Provides better security against brute-force attacks
Supports encryption of large and diverse files
Abstract
A novel bit level block cipher based symmetric key cryptographic technique using G.C.D is proposed in this research paper. Entire plain text file is read one character at a time and according to the binary representation of ASCII value of the characters, entire plain text file is divided into n number of 16 bit blocks. Then an agreed-upon symmetric key file is formed by dividing each 16 bit block into two 8 bit sub blocks and by using Greatest Common Divisor (G.C.D) operation among them. The key size is 40 times the number of 16 bit blocks present in the plain text file as each block produces a key of size 40 bits. The character corresponding to the G.C.D value for each block is stored in the cipher text file which is sent by the sender to the receiver along with the symmetric key file. From the symmetric key file and the cipher text file, the receiver by applying reverse procedure,…
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
TopicsChaos-based Image/Signal Encryption · Cryptographic Implementations and Security · Fractal and DNA sequence analysis
