Related Experiment Video
Updated: Aug 22, 2025

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
Published on: September 5, 2019
A New Chaotic Image Encryption Algorithm Based on Transversals in a Latin Square.
Honglian Shen1,2, Xiuling Shan1, Ming Xu3
1School of Mathematical Sciences, Hebei Normal University, Shijiazhuang 050024, China.
This study introduces a novel image encryption method using Latin squares and n-transversals for secure and efficient data protection. The scrambling-diffusion-scrambling technique offers robust performance and practical application.
Area of Science:
- Cryptography
- Combinatorial Mathematics
- Computer Science
Background:
- Image encryption is crucial for data security.
- Existing methods face challenges in balancing security and efficiency.
- Combinatorial structures offer potential for novel encryption algorithms.
Purpose of the Study:
- To introduce a new image encryption algorithm based on n-transversals of Latin squares.
- To enhance security and efficiency in image encryption.
- To demonstrate the algorithm's effectiveness through rigorous testing.
Main Methods:
- Utilizing an n-transversal of a Latin square to permute image pixels.
- Implementing a scrambling-diffusion-scrambling process.
- Employing chaotic sequences and orthogonal Latin squares for diffusion and secondary scrambling.
Main Results:
- The proposed algorithm achieved excellent encryption effect regarding security and efficiency.
- Experimental results demonstrated robustness, passing various security tests.
- Achieved high information entropy (near 8) and low correlation coefficient (approx. 0).
Conclusions:
- The novel image encryption algorithm is secure, efficient, and practical.
- The use of n-transversals and Latin squares provides a strong foundation for image security.
- The method outperforms many recent image encryption techniques.
Related Concept Videos
Cartesian Vector Notation
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Cartesian Form for Vector Formulation
Norton's Theorem
Wald-Wolfowitz Runs Test II
For binary data, runs are identified using symbols such as + and −, or equivalently, 1s and...

