A Scalable Hybrid Encryption Framework Based on Unimodular Hill Cipher, Logistic Chaotic Key Generation, and AES-CBC for Secure Binary File Protection

Imagine you are living in a world where every single thing you own—your photos, your music, your school essays, and even the secret recipes for your favorite cookies—is stored as a long, endless stream of tiny digital bricks called "bytes." In the digital world, these bytes are the universal building blocks. Whether it's a picture of a cat or a spreadsheet of numbers, they all look the same to a computer: just a sequence of zeros and ones. The big challenge for scientists is how to lock these bricks up so that no one can steal or mess with them. For a long time, people tried to use different locks for different types of boxes (a special lock for pictures, another for documents), but that was like trying to carry a keyring with a hundred different keys just to open your front door. It was messy and often left some boxes slightly unlocked.

To solve this, researchers use a few clever tricks. One old trick is the "Hill Cipher," which is like arranging your bricks into a grid and then shuffling them around using a secret math recipe (a matrix). If you don't have the exact recipe, you can't un-shuffle them. Another trick involves "Chaos," which is like a butterfly flapping its wings in a storm; a tiny change in the starting point creates a completely different, unpredictable weather pattern. This is great for making secret keys because it's impossible to guess the next step. Finally, there's "AES," a super-strong, modern lock that everyone agrees is very hard to break, often used as a backup for the pieces that don't fit into the main shuffling grid. The goal of this new research is to combine these three ideas into one master key that can lock any digital file, no matter what it is, without leaving any gaps.

---

The Universal Digital Locksmith

Meet the team from Institut Teknologi Sains Bandung and Universitas Jember. They looked at the digital world and noticed a problem: most security systems are like specialized tailors who only make suits for one specific body type. If you have a picture, they use one method; if you have a video, they use another. But what if you have a weird, mixed-up file that doesn't fit the mold? The researchers proposed a new, "scaly" (meaning it can grow or shrink) framework that treats every digital file exactly the same: as a raw stream of bytes. They call this a "Hybrid Encryption Framework," which is a fancy way of saying they built a security system that uses three different layers of protection working together.

First, they needed a way to create a secret key that changes every time, even if you type the same password. They used something called a "Logistic Map," which is a simple math formula that acts like a chaotic whirlwind. Imagine you are spinning a top; if you give it the tiniest nudge, it wobbles in a completely different direction. By turning your password into the starting push for this math whirlwind, they generate a unique, unpredictable sequence of numbers. This sequence is the seed for their secret key.

Next, they tackled the "Hill Cipher." In the old days, this method used small grids (like 2x2 or 3x3) to shuffle data. But the researchers realized that small grids aren't strong enough for big files, and making big grids is hard because you have to check if they can be "un-shuffled" later. Their breakthrough was using "Unimodular Matrices." Think of this as a special kind of grid where the math guarantees that it can always be reversed, no matter how big you make it. They built these grids dynamically, meaning the size of the grid changes based on how big and complex your file is. If you have a tiny text file, they use a small grid. If you have a massive video file, they automatically switch to a huge grid (up to 48x48) to make the shuffling much harder to crack. This is their "Adaptive Matrix Selection" strategy.

But what happens when your file has a few extra bytes left over that don't fit perfectly into the grid? In the past, people would just pad them with zeros, which is like taping a piece of paper to the door—it leaves a weak spot. This new system doesn't pad; instead, it takes those leftover bytes and locks them with a different, super-strong lock called "AES-CBC." This is the same kind of lock used by banks and governments. So, the main part of the file gets shuffled with the giant, custom-made grid, and the tiny leftovers get locked in a steel vault.

The team tested this system on all sorts of files, including images like "Lena" and "Baboon," and even a PDF document. They found that after encryption, the files looked like pure static noise. Before encryption, the data had patterns (like how a photo has lots of similar colors next to each other). After encryption, the "Shannon Entropy"—a measure of how random the data looks—jumped to nearly 7.9998 bits/byte. That is as close to perfect randomness as you can get for 8-bit data. They also checked the "Avalanche Effect," which measures what happens if you change just one tiny thing in the original file. In their system, changing one letter caused about 50% of the entire encrypted file to change completely. This means a hacker can't guess the rest of the file even if they know a little bit of the original.

Perhaps most importantly, they proved that this system is "lossless." When they locked the files and then unlocked them, the files came out exactly the same, byte for byte. They verified this using MD5 hashes, which are like digital fingerprints; the fingerprint of the original file matched the fingerprint of the decrypted file perfectly every time. They also showed that the system passes rigorous randomness tests (NIST SP800-22), meaning the encrypted data looks indistinguishable from true random noise to any statistical analysis.

The paper explicitly rules out the idea that you need to know what kind of file you are encrypting (like knowing it's a JPEG or a PDF) to protect it. They argue against using fixed grid sizes that don't adapt to the file, and they show that simple padding methods are inferior to their hybrid approach. While the results are based on simulations and experiments on various datasets, the authors are very confident in the statistical security, noting that the system successfully eliminates structural redundancies and resists common attacks. However, they do admit that their current setup uses a single chaotic map and that future work could look at even more complex chaotic systems to make the keys even harder to guess.

In the end, this research suggests a future where you don't need a different security strategy for your photos, your music, or your documents. You just have one universal system that adapts to the size and shape of your data, shuffling the main bulk with a giant, custom math grid and locking the leftovers in a steel vault, leaving you with a file that looks like pure, uncrackable static.