![]() On my X5660 Xeon at work, running 12 processes, the same file takes a little over 20 seconds, something like 48 bytes/sec. On this Q6600 machine, with 4 processes going, it averages about 25 bytes/sec total throughput. In any case, that test file is just barely over 1KB in size, 1041 bytes I believe, so you can see how terribly slow the whole operation is. Binary file restoration complete (Elapsed Time: 00:00:00.07)Ĭ:\Users\Marc\Desktop\aes>fc /b file.bin file(1).binįC: no differences encounteredYou'll notice one pesky bug I haven't been able to get rid of, a warning that "The system cannot find the drive specified." I know for a fact it finds it just fine and the output is correct, but I haven't been able to shake that message. Restoring binary file from ASCII-coded hexadecimal. AES Decryption Complete (Elapsed Time: 00:00:40.42) The system cannot find the drive specified. AES Encryption Complete (Elapsed Time: 00:00:41.83)Ĭ:\Users\Marc\Desktop\aes>aes aes.key Hexadecimal Conversion Complete (Elapsed Time: 00:00:00.55) Defaults to one process per CPU core.Ĭ:\Users\Marc\Desktop\aes>aes file.bin aes.keyĬonverting input file to ASCII-coded hexadecimal. : An integer corresponding to the number of parallel processes If not provided the program will prompt for a key. The path to a keyfile, or a varible containing a 32-, 48- orĦ4-character string of hexadecimal values (ie: a 128-, 192- orĢ56-bit key). : Either a complete path to a keyfile, a variable containing Variable containing the target file's path. : A complete path to the file to be processed or the name of a '.aes' input files are decrypted to a file of the same name with the. '.aes' are encrypted to a file of the same name, plus an. ![]() Here is what it looks like under normal operation:Ĭode: Select all c:\Users\Marc\Desktop\aes>aesĮncrypts or decrypts the input file using the Advanced Encryption StandardĪlgorithm as specified in NIST FIPS-197. There are still a couple of bugs to work out, and likely some performance optimizations, but the basic functionality is there so I wanted to post a demo. I do have to give a HUGE thanks to Aacini for his BinToHex and HexToBin scripts ( viewtopic.php?f=3&t=4842), as I use modified versions of his work to convert to and from the hex codes processed by my AES batch. The algorithm itself is compliant with FIPS-197 (tested to the examples in the standard document) and the mode of operation is Electronic Codebook (ECB). ![]() It's "thread safe", even if something were to go wrong the processes kill themselves after a pre-defined blocking period. Picking up where I left off in that other thread, my AES batch can now encrypt and decrypt entire files (very slowly ) using as many processes (PIDs) as you have CPU cores for. It's been over 2 months since there's been any activity in the original "string encoding" thread ( viewtopic.php?f=3&t=4579), so rather than post this in with all the cluttered proofs of concept I put there, I thought a full working release deserved a thread of it's own.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |