Image Encryption Scheme Based on Knight's Tour Problem

This work introduces a new approach in the field of visual cryptography by extending the Knight's Tour Problem. Designed methodology enhances image encryption but without the need of cover images. It accepts numerical values as key and there is no constraint on the length of key. Another important aspect of the designed methodology is that only a single image has to be transmitted and the actual image can be retrieved hence this approach eliminates the need of transmitting multiple shares.