An efficient algorithm for key generation in advance encryption standard using sudoku solving method

AES is one of the most secure and efficient symmetric cryptosystem for encryption process. In AES, Rijndael Algorithm is used for key generation and expansion. The key size used in AES is 128/192/256 bits and the researchers are proposed different algorithms like random bit generator or key pool mechanisms for the key generation. In this paper, we have presented an efficient algorithm for key pool generation by using Sudoku puzzle solving mechanism. The proposed scheme simplifies the process of key generation and expansion cipher key. In AES, this process consider as one of the most important concept in encryption process. This algorithm is use to generates an individual key pool for each user. This key pool shared between the communicating authorized parties. During the Encryption process, the algorithm will select the schedule keys randomly from the pool of keys. The receiver will receive the index value of a starting element in key and key length.