The Dynamic Key and Algorithm Implementation ...

URL: http://www.sjie.org/paperInfo.aspx?ID=455

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.

There are no views created for this resource yet.

Additional Information

Field Value
Last updated May 14, 2013
Created unknown
Format aspx
License Other (Open)
Createdover 12 years ago
Media typetext/html
Size30,800
formataspx
id013376f1-a647-4f48-ab58-38ef662fd14b
last modifiedover 12 years ago
package id457a2803-93f8-4dc4-bca2-fe66aad2ee40
resource typefile
revision idf15ea67e-7603-4eec-a919-87ce4f40f917
stateactive