1. A NOVEL IMAGE SCRAMBLING BASED ON SUDOKU
PUZZLE
D.N.R College Of engineering & technology
Department Of Electronics & Communication Engineering
Under the esteemed guidance of
N.S.V.L Sowjanya M.Tech
Asst. Professor
Presented by-batch16
S.RAJA -129P1A0457
V.SATEESH -139P5A0433
T.NEERAJA -132E5A0416
P.SURI BABU -139P5A0428
S.H.S.S KISHORE -129P1A0455
3. OBJECTIVE
This paper introduces a novel image scrambling algorithm based
on Sudoku puzzle.
According to the special property that every number from 1 to N
appears only once in each row or column in an N*N Sudoku
puzzle, a 1-1 relationship can be setup between two Sudoku
puzzles.
These two Sudoku puzzles will be used to map the original images
to a scrambled one.
4. EXISTING METHOD
In old technique use only the pixel scrambling to
over come this method we use the Sudoku puzzle
technique in this we apply pixel scrambling and
bits scrambling.
5. PROPOSAL METHOD
One of the new method in image encryption in this
involving a both block scrambling and bit scrambling
and also introduce a Sudoku puzzle based on the all
these things we can scramble and descramble the image.
8. PUZZLE PREPARATION
Row: New Value = Old Value + (Row × 10^digits)
Column: New Value = Old Value + (Column × 10^digits)
4 2 1 3
3 1 2 4
2 3 4 1
1 4 3 2
1 2 3 4
4 3 1 2
2 1 4 3
3 4 2 1
9. PUZZLE PREPARATION
By using this column formula we can change the each
value in column.
By using this row formula we can change the each value
in row.
4 2 1 3
3 1 2 4
2 3 4 1
1 4 3 2
14 22 31 43
13 21 32 44
12 23 34 41
11 24 33 42
1 2 3 4
4 3 1 2
2 1 4 3
3 4 2 1
11 12 13 14
24 23 21 22
32 31 34 33
43 44 42 41
10. BLOCK SCRAMBLING
By using this block scrambling we can mapping the
puzzles and converted into a single puzzle.
example: mapping process.
14 22 31 43
13 21 32 44
12 23 34 41
11 24 33 42
11 12 13 14
24 23 21 22
32 31 34 33
43 44 42 41
11. BLOCK SCRAMBLING
By using above technique we can mapping the original image.
original image scrambled image
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
13 9 5 1
14 10 6 2
7 3 11 15
4 8 16 12
12. BITS SCRAMBLING
In order to reduce the block effects of the scrambled image obtained from above
step, it is necessary to scramble it at bits level. The following steps will show
how to achieve this goal. Before doing the bits scrambling, the scrambled image
is needed to be changed to a 1-D matrix by connecting each rows together (Row
2 is moved to the end of row 1 and row 3 is moved to the end of row 2, etc.).
13 9 5 1
14 10 6 2
7 3 11 15
4 8 16 12
13 9 5 1 14 10 6 2 7 3 11 15 4 8 16 12
15. DESCRAMBLING
We can descrambling the above process by converting bits
scrambling into block scrambling, block scrambling into original
image at the decoder.
Bits descrambling Block descrambling Original image
16. CONCLUSION
A new image scrambling algorithm is introduced.
The main idea is to pair of Sudoku puzzle to map
the block in one matrix to other.
based on that key the information contained in the
scrambled image has good security so these can
applied to a encrypt digital images.
17. FUTURE SCOPE
These can be implemented in hardware kit.
This algorithm can be used to scramble the
watermark image in image and video
watermarking.
Military applications.
18. REFERENCES
Dimitri Van De Ville, Wilfried Philips, Rik Van De Walle,
IgnaceLemahieu, “Image Scrambling Without Bandwidth
Expansion,” IEEE transactions on Circuits and Systems for Video
Technology, Vol. 14, pp. 892-897, June 2004
Aaronson, L, “Sudoku Science”, IEEE Spectrum, vol.43, pp. 16-
17, Feb.2006.
Baochen Sun, Xiwei Sun, Yue Wu, Yiling Yin, Goping Yang, “A
New Algorithm for Generating Unique- Solution Sudoku”, Fourth
International Conference on Natural Computation (ICNC '08),
Vol.7, pp. 215, Nov. 2008
