← Latest papers
💻 computer science

A Scalable Hybrid Encryption Framework Based on Unimodular Hill Cipher and Chaotic Logistic XOR Stream Cipher for Secure Binary File Protection

This paper proposes a scalable hybrid encryption framework that combines the Unimodular Hill Cipher with a chaotic Logistic Map-based XOR stream cipher to provide secure, efficient, and format-independent protection for arbitrary binary files, achieving near-ideal randomness, strong resistance to statistical attacks, and lossless recovery with high throughput.

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

Published 2026-07-30
📖 4 min read☕ Coffee break read

Original authors: Samsul Arifin¹, 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

Imagine you are trying to send a secret message to a friend, but you know that anyone who intercepts it might try to crack the code. In the world of digital science, this is the job of cryptography: the art of turning readable information (called "plaintext") into a scrambled mess (called "ciphertext") that looks like random noise to anyone without the key. For decades, scientists have used two main tricks to do this. The first is mathematical mixing, like shuffling a deck of cards where the position of every card depends on the others. The second is chaos, a concept borrowed from nature where tiny changes in the starting conditions lead to wildly different outcomes—think of how a butterfly flapping its wings might eventually cause a storm far away. When you combine these two, you get a system that is both mathematically strong and unpredictably wild. As our lives move more into the cloud, storing everything from school essays to family photos, we need encryption that can handle any type of file without breaking it, keeping our digital secrets safe from prying eyes.

This paper introduces a new, hybrid encryption framework designed to protect binary files—which is just a fancy way of saying any digital file, whether it's a Word document, a PDF, or a JPEG image. The authors, a team of researchers from Indonesia, propose a system that acts like a two-step security dance. First, they use something called the Unimodular Hill Cipher. Imagine this as a giant, complex grid or a matrix where you take chunks of your file and multiply them by a special key. This step is great at "diffusion," meaning it spreads the influence of every single letter or pixel across the whole file, so changing one tiny bit changes everything else. However, the researchers knew that this mathematical step alone is a bit too predictable, like a dance with a set routine that a clever hacker could eventually memorize.

To fix this, they added a second step: a Chaotic Logistic XOR Stream Cipher. Think of this as a chaotic, unpredictable stream of water that splashes over the already-shuffled file. They use a mathematical formula called the "Logistic Map" to generate a stream of random-looking numbers. They then mix these numbers with the file using a simple operation called XOR (which is like a secret toggle switch: if you flip it twice, you get back to where you started). This adds a layer of "confusion," making the final result look completely random and impossible to reverse without the exact chaotic key. The beauty of this system is that it treats every file as a raw stream of bytes, ignoring what the file actually is. It doesn't need to know if it's encrypting a photo or a spreadsheet; it just scrambles the data and then unscrambles it perfectly later.

The team tested their idea on twelve different files, ranging from small 1 MB documents to massive 100 MB files, including DOCX, PDF, and JPEG formats. They measured how well the system worked by looking at things like entropy (a measure of randomness) and correlation (how much one part of the file hints at another). The results were impressive: the encrypted files had an average entropy of 7.9999, which is almost perfectly random (the ideal is 8.0), and a correlation coefficient of -0.0043, meaning there was almost no relationship between neighboring bytes. In simpler terms, the encrypted data looked like pure static noise. They also checked the Avalanche Effect, which tests if a tiny change in the input creates a huge change in the output. Their system achieved 50.0020%, which is the gold standard for encryption, proving that a tiny tweak in the key or file completely reshuffles the result.

Crucially, the paper emphasizes that this method is lossless. When they decrypted the files, the MD5 hash (a digital fingerprint) of the recovered file matched the original exactly, 100% of the time. This means no data was lost or corrupted during the process. The system was also fast, processing files at an average speed of 24.48 MB/s for encryption and 23.83 MB/s for decryption, and it scaled well as the file sizes got bigger. However, the authors are careful to note that while their simulations show excellent statistical security, they haven't yet tested the system against every possible type of advanced hacker attack, such as specific known-plaintext attacks. They suggest that while their hybrid approach balances speed and security very well, future work could explore even more complex chaotic systems to make it even stronger. For now, they have shown that mixing a solid mathematical shuffle with a chaotic splash is a promising way to keep our digital files safe, no matter what kind of file they are.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →