Recursive Information Hiding of Secrets by Random Grids

Abstract

This article presents the method of recursive information hiding of secret images by random grids, which hides the additional secret information in the shares of the larger secret in a recursive manner. The proposed method increases the information conveyed per bit of the shares to nearly 100 percent, and has the size of each share the same as that of the original secret image without any expansion. The smaller size of the shares makes their further processing, such as storage and distribution, more efficient.

Keywords:

• image encryption
• random grids
• recursive information hiding
• visual cryptography
• visual secret sharing

Additional information

Notes on contributors

Sachin Kumar

Sachin Kumar received his postgraduate degree in mathematics in 2004 from Indian Institute of Technology Roorkee, India. In 2012, he received his PhD degree in Cryptology from Indian Institute of Technology Delhi, India. His research interests include image encryption, visual secret sharing and elliptic curve cryptography.

R. K. Sharma

R. K. Sharma is Professor and former Head at Department of Mathematics, Indian Institute of Technology, Delhi. Earlier, he has been on the faculty of mathematics at IIT Kharagpur. He has guided twelve PhD theses and more than 40 M.Tech projects. He has published more than 50 research papers in international journals. He has also published two books, Algebra I, by Pearson (three volumes are planned), Complex Numbers by Anthem Press. He has developed some web courses also under the NPTEL program. He has participated in the International Congress of Mathematicians (ICM) 1994, in Zurich, Switzerland. He has traveled widely and delivered invited talks at several places. He was a post-doctoral fellow in France and Germany for three years. Several students are working with him on sponsored projects. His main area of research is Algebra and Cryptography.