💻 computer science

A Dynamic Hybrid Cryptosystem Combining Unimodular Hill Cipher, Chaotic Logistic Maps, and ECC for Efficient Binary File Encryption

This paper presents the Hybrid Split-Based Chaotic Cryptosystem (HSBCC), a unified framework that integrates a dynamically generated unimodular Hill Cipher, Logistic Map-based key derivation, and Elliptic Curve Cryptography to achieve secure, lossless, and size-preserving encryption for arbitrary binary files.

Original authors: Samsul Arifin¹, Alya Maura Raditha, Ade Kurniawan, Tiawan Tiawan, Merios Gusan Putra, Edwin Kristianto Sijabat, Dani Lukman Hakim, Dwi Wijonarko

Published 2026-07-30

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Samsul Arifin¹, Alya Maura Raditha, Ade Kurniawan, Tiawan Tiawan, Merios Gusan Putra, Edwin Kristianto Sijabat, Dani Lukman Hakim, Dwi Wijonarko

Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Digital Locksmith's New Toolkit

Imagine the internet as a massive, bustling city where everyone is constantly sending secret letters to one another. In this city, cryptography is the art of writing those letters in a code so complex that only the intended recipient can read them. For decades, the best codes relied on two main tricks: mathematical puzzles (like scrambling letters using a giant grid) and chaos (using unpredictable, wild patterns that look random but follow strict rules). The problem is that old-school puzzles can sometimes be cracked if the grid isn't perfect, and pure chaos can be hard to control. This paper dives into a corner of computer science called hybrid cryptosystems, which tries to combine the best of both worlds to create a lock that offers strong cryptographic robustness, is perfectly reversible, and works on any kind of digital file, not just pictures.

The Paper's Big Idea: A Split-Second Magic Trick

The researchers behind this study, led by Samsul Arifin and his team from Institut Teknologi Sains Bandung, have cooked up a new encryption system they call HSBCC (Hybrid Split-Based Chaotic Cryptosystem). Think of this system as a master digital locksmith who doesn't just use one key, but a whole toolbox of tricks to secure your files.

Here is the secret sauce: instead of trying to force every single file into one rigid mold, the HSBCC system uses a "split-based" strategy. Imagine you have a giant pile of Lego bricks (your digital file). Most old encryption methods would try to chop this pile into perfect, equal-sized squares. If you had a few extra bricks left over, they'd have to add "padding" (fake bricks) to make the pile fit, which changes the size of your original file. The HSBCC team says, "No thanks!" Instead, they split the pile into two groups. The big, main group gets scrambled using a Unimodular Hill Cipher. This is a fancy mathematical grid that shuffles the bricks around. The key innovation here is that their grid is "unimodular," which is a fancy way of saying it's mathematically guaranteed to be reversible. No matter how wild the shuffle, you can always put the bricks back exactly where they were without losing a single piece.

But what about those leftover bricks that don't fit the grid? That's where the second trick comes in. The tiny remainder group gets a quick, simple spin using something called Shift Cipher 128. It's like giving the leftover bricks a quick spin in a washing machine. This ensures every single byte of your file gets encrypted, but without adding any extra "padding" bricks. The result? Your encrypted file is exactly the same size as your original file, preserving the format perfectly.

The Chaotic Heartbeat

To make sure the "shuffling grid" is different every time you lock a file, the system uses a Logistic Map. Imagine a ball bouncing on a trampoline. If you drop it from almost the exact same spot, it might land in the same place. But if you drop it from a spot that is infinitely close but slightly different, the ball will bounce in a completely wild, unpredictable direction after just a few bounces. This is called the "butterfly effect." The researchers use a user's password to decide exactly where to drop the ball. Because of this chaos, even if two people type passwords that are almost identical, the resulting encryption keys will be totally different. This makes it nearly impossible for a hacker to guess the key by trying small variations.

What They Found: Perfect Recovery and Total Chaos

The team tested their new system on a variety of digital files, including colorful images (like the famous "Lena" photo), medical brain scans (MRI images), and even a large PDF document that was 815,491 bytes long. They ran these tests on a computer using Python and NumPy, a tool for doing fast math.

The results were impressive. When they encrypted the files, the data looked like pure static noise. If you looked at a graph of the colors in an encrypted image, it was perfectly flat and random, with no patterns left behind. This is crucial because it means a hacker can't use statistical tricks to guess what the original picture looked like. The system also passed a "correlation test," proving that the relationship between neighboring pixels was completely destroyed; in the original image, neighbors were very similar, but in the encrypted version, they were as different as night and day.

Most importantly, the system proved to be 100% lossless. When they decrypted the files, the recovered versions were identical to the originals. They checked this using a digital fingerprint called an MD5 hash. In every single test, the hash of the decrypted file matched the hash of the original file perfectly. This means not a single bit of data was lost or corrupted during the process.

They also tested how the system handled different sizes of the "shuffling grid" (called matrix dimensions). They tried grids as small as 8x8 and as large as 888x888. Even with the massive 888x888 grid, the system successfully encrypted the 815,491-byte PDF file. While the decryption took longer for the bigger grids (about 9.37 seconds for the largest one compared to 0.02 seconds for the smallest), the system still worked perfectly every time, and the file size remained exactly the same.

Why This Matters

The paper explicitly rules out the need for "padding" (adding fake data to fill space) and the need to store the encryption key separately. In many older systems, if the key matrix wasn't "invertible" (meaning you couldn't reverse the math), the file would be lost forever. The HSBCC system solves this by guaranteeing that the key matrix is always invertible, thanks to its unimodular design.

The authors suggest that this approach offers a balanced mix of high security and practical speed. By splitting the file and using a chaotic, password-driven key generator, they created a system that is robust against attacks, preserves file integrity, and works on any type of binary data, from images to documents. While the decryption time gets slower with very large grids, the simulations show that for most practical file sizes, the system is fast enough to be useful in the real world, offering a secure way to lock up digital secrets without changing the shape or size of the lock itself.

Technical Summary: A Dynamic Hybrid Cryptosystem Combining Unimodular Hill Cipher, Chaotic Logistic Maps, and ECC

Problem Statement
Modern cryptographic systems face increasing challenges from the exponential growth of digital data and sophisticated cyberattacks. Traditional encryption schemes often rely on single mathematical structures, rendering them vulnerable to advanced cryptanalysis. Existing chaos-based encryption and Hill Cipher variants suffer from specific limitations: they frequently focus on image data rather than arbitrary binary files, rely on static or externally stored key matrices, lack guaranteed matrix invertibility (a critical requirement for the Hill Cipher), and often require padding mechanisms that alter the original file size. Furthermore, many existing frameworks fail to simultaneously address public-key integration, integrity verification, and scalability for large matrix dimensions within a unified architecture.

Methodology
The paper proposes the Hybrid Split-Based Chaotic Cryptosystem (HSBCC), a unified framework designed to secure arbitrary binary files. The system integrates symmetric encryption, chaotic dynamical systems, and public-key cryptography through a layered architecture:

Dynamic Key Generation: The system utilizes a Logistic Map ( $x_{n+1} = r x_n(1-x_n)$ with $r=3.923$ ) driven by user passwords to generate chaotic sequences. These sequences are transformed into discrete integer values to populate a key matrix.
Unimodular Hill Cipher: To ensure lossless decryption, the system constructs a dynamically generated unimodular matrix (where $\det(K) = \pm 1$ ). This guarantees that the matrix is invertible modulo 256, eliminating the common failure mode of standard Hill Ciphers where the determinant shares a factor with the modulus. The matrix is constructed by initializing an identity matrix, populating the upper triangular region with chaotic values, and applying Elementary Row Operations (EROs) to create a dense, invertible matrix without external storage.
Split-Based Encryption Architecture: The plaintext is partitioned into two segments to handle arbitrary file sizes without padding:
- Primary Segment: Processed via the Unimodular Hill Cipher ( $C = K \cdot P \mod 256$ ).
- Secondary Segment (Remainder): Processed via a Shift Cipher 128 ( $C = (P + 128) \mod 256$ ). This lightweight transformation handles bytes that do not fit the matrix dimension, ensuring the ciphertext size remains identical to the plaintext.
Key Management and Integrity:
- ECC: Elliptic Curve Cryptography (P-256) is employed for key-pair generation and secure session key protection.
- AES: A session key is generated and protected using AES in EAX mode, derived from user passwords via PBKDF2.
- Integrity: MD5 hashing is used to verify file integrity and confirm lossless decryption.

Key Contributions

Guaranteed Invertibility: The construction of dynamic unimodular matrices ensures that the Hill Cipher component is always reversible for any matrix dimension $n$ , solving a fundamental limitation of classical implementations.
File-Size Preservation: The split-based architecture eliminates the need for padding, preserving the exact original file size and format, which is critical for binary file encryption (e.g., PDFs, executables).
Deterministic Key Reconstruction: The system regenerates the encryption matrix deterministically from user passwords, removing the need to store or transmit the key matrix, thereby reducing key-management overhead and leakage risks.
General-Purpose Applicability: Unlike many chaos-based systems limited to images, HSBCC operates directly on arbitrary binary data streams.
Scalability Analysis: The framework was evaluated with matrix dimensions up to $888 \times 888$ , demonstrating the system's ability to handle large key spaces while maintaining functional correctness.

Experimental Results
The system was evaluated using benchmark images (Lena, Baboon, Peppers, Cameraman), medical MRI images, and binary files including a 815,491-byte PDF document. Key findings include:

Statistical Security: Encrypted files achieved Shannon entropy values approaching the theoretical maximum (7.9961–7.9987 bits/pixel) and reduced adjacent-pixel correlation coefficients to near-zero (approx. 0.002), effectively destroying statistical redundancy.
Key Sensitivity: The system exhibited a strong avalanche effect; a single-unit change in the password resulted in ciphertext differences exceeding 99.9%, confirming high sensitivity to initial conditions.
Lossless Decryption: All decrypted files produced MD5 hashes identical to the original plaintext, confirming 100% recovery accuracy across all tested file types and matrix dimensions.
Performance: Encryption times remained practical (sub-second for smaller matrices, ~1.4s for $n=888$ ). Decryption times increased with matrix size due to the computational cost of modular matrix inversion (up to ~9.4s for $n=888$ ), but remained within feasible limits for the tested datasets.
Ciphertext Uniqueness: Different matrix dimensions and password combinations produced distinct ciphertexts with unique MD5 hashes, demonstrating effective key diversification.

Significance
The paper positions HSBCC as a robust, scalable, and flexible cryptographic framework that addresses the limitations of existing chaos-based and matrix-based systems. By synthesizing unimodular linear algebra, chaotic dynamics, and modern cryptographic primitives (ECC and AES), the system achieves a balance between high security and computational feasibility. The authors claim that HSBCC provides a secure method for protecting arbitrary binary data with strong cryptographic robustness, deterministic key generation, and complete preservation of file integrity and format, making it suitable for resource-constrained and high-security environments.