A NOVEL IMAGE SCRAMBLING BASED ON SUDOKU PUZZLE

D.N.R College Of engineering & technologyDepartment Of Electronics & Communication Engineering

Under the esteemed guidance of N.S.V.L Sowjanya M.Tech

Asst. Professor

Presented by-batch16S.RAJA -129P1A0457V.SATEESH -139P5A0433T.NEERAJA -132E5A0416P.SURI BABU -139P5A0428

S.H.S.S KISHORE -129P1A0455

CONTENTS

Objective Existing method Proposal method Block diagram Working methodology Conclusion Future scope Reference

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.

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.

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.

BLOCK DIAGRAM

Original image

Puzzlepair

Puzzlepreparation

Block scrambling

Bits scrambling

o/p

Received image

Bits Descrambling

Block Descrambling

Original image

Decoding

Encoding

SCRAMBLING

4 2 1 33 1 2 42 3 4 11 4 3 2

1 2 3 44 3 1 22 1 4 33 4 2 1

1 2 3 4

5 6 7 8

9 10 11 12

13 14 15 16

Puzzle 1 Puzzle 2 Original image

PUZZLE SELECTION

PUZZLE PREPARATION

Row: New Value = Old Value + (Row × 10^digits) Column: New Value = Old Value + (Column × 10^digits)

4 2 1 33 1 2 42 3 4 11 4 3 2

1 2 3 44 3 1 22 1 4 33 4 2 1

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 33 1 2 42 3 4 11 4 3 2

14 22 31 4313 21 32 4412 23 34 41

11 24 33 42

1 2 3 44 3 1 22 1 4 33 4 2 1

11 12 13 1424 23 21 2232 31 34 3343 44 42 41

BLOCK SCRAMBLING By using this block scrambling we can mapping the

puzzles and converted into a single puzzle.

example: mapping process.

14 22 31 4313 21 32 4412 23 34 41

11 24 33 42

11 12 13 1424 23 21 2232 31 34 3343 44 42 41

BLOCK SCRAMBLING

By using above technique we can mapping the original image.

original image scrambled image

1 2 3 45 6 7 8

9 10 11 1213 14 15 16

13 9 5 114 10 6 2

7 3 11 154 8 16 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 27 3 11 15

4 8 16 12

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

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 0 0 0 0 0 1 01 1 0 0 1 1 0 0 0 0 1 1 0 1 0 11 0 1 0 1 0 1 0 1 0 0 1 1 0 0 10 0 0 0 1 1 1 1 1 1 1 1 0 0 0 01 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0

BITS SCRAMBLING

BITS SCRAMBLING

1 1 0 01 0 1 00 0 0 01 1 1 1

1 1 0 11 0 0 11 0 0 10 0 1 0

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

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.

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.

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

Thank you