Data Hiding and Retrieval Using Permutation Index Method

Abstract

In this paper a novel approach for matrix manipulation and indexing is proposed .Here the elements in a row of matrix are designated by numeric value called permutation index followed by the elements of the row being randomised. This is done for all the rows of the matrix and in the end the set of permutation indices are put in the parent matrix and random locations depending on a pre decided scheme called passkey. This passkey is used to put back the elements of all the rows back in the correct sequence. This approach finds application in data encapsulation and hiding.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…