The Dynamic Key and Algorithm Implementation Based on Rijndael

Through studying on the Rijndael encryption algorithm, combining the algorithm with the function RAND () of C language and taking computer system time as a seed to generate the pseudorandom number from the function, we construct dynamic keys and a dynamic encryption algorithm, and implement of computer programs. The algorithm allows a key to encrypt the same plaintext many times and the corresponding ciphertexts are different if encryption time does alter. The dynamic encryption algorithm doesn’t only solve the problem of vexing users to modify keys frequently but also enables to encrypt a plaintext more easily, more conveniently and more securely. From the dynamic encryption algorithm we find that it is extremely difficult for an attacker to break a ciphertext using chosen plaintext, known plaintext, or chosen-ciphertext. For encryption users, as long as the key is protected well, he doesn’t need to modify the key for a long time. Therefore, encrypted information becomes more secure. http://www.sjie.org/paperInfo.aspx?ID=455

Data and Resources

Additional Info

Field Value
Last Updated October 10, 2013, 23:53 (UTC)
Created May 15, 2013, 03:30 (UTC)