Methods and Systems for Multidimensional Sudoku Puzzles, Ciphers, and Generators


Many image scrambling and image encryption algorithms have been developed based on different principles. Generally these algorithms can be divided into two categories based on the type of encryption domain Summary

This invention relates to methods of generating a Sudoku matrix with optimal efficiency without random guesses. The methods comprise a parametric Sudoku generator based on expanding and shuffling a Latin square. The Sudoku arrays produced by this method find use in applications as far ranging as puzzles and toys to the robust and secure encryption of data (e.g., an image).


As it relates to encryption, the Sudoku encryption technology has some distinct properties compared with conventional block ciphers such as DES, IDEA, and AES. First, the proposed cryptosystem is suitable for large volume data encryption such as images, audio, and video, and is appropriate for many types of data and content, such as military images, identification images (e.g., a fingerprint), medical images (e.g., a MRI brain scan), and private images. Second, the output of the cryptosystem almost follows a uniform distribution. This statistical property helps to prevent attacks based on statistical analysis. Thirdly, the cryptosystem is highly sensitive to the encryption key. This implies that even a slight change in the key will lead to a great change in the ciphertext. This property makes sensitivity-based attacks ineffective. Fourth, the cryptosystem permutes the plaintext extensively and correlations between neighboring plaintext pixels are removed or minimized in the encrypted ciphertext. Finally, the encryption and decryption algorithms are easily implemented in hardware.


Intellectual Property

US Patent 9,975,037 (May 22, 2018)


Licensing Contact

Suresh Annavarapu