Click here to Skip to main content
11,410,129 members (61,079 online)
Click here to Skip to main content

A Fast and Easy to Use AES Library

, 28 Dec 2011 CPOL
Rate this:
Please Sign up or sign in to vote.
A fast and easy to use AES library.


EfAesLib is a highly optimized Advanced Encryption Standard (AES) library for the Windows platform 32-bit architecture. The Extreme Fast AES Library is implemented based on the official document:

The library is actually my personal work. I have decided to put it in the public domain and make it free. The size is a little on the higher side because of some optimization to use space in exchange of time.

I have provided the compiled DLL in VS2008, and the project files; or you can use the source in any other platform, it is just plain 'C'.

Using the code

AES is a 128-bit block encrypt/decrypt algorithm. That means you need to carefully handle the last block which is not 16 bytes aligned. Otherwise, you might be unable to decrypt correctly.

There are many block modes defined in the cipher realm. Different block modes have different characteristics. For example, the CRT mode only needs encryption logic, so it is suitable for low cost hardware implementations. The PCBC mode provides better error propagation. As for CFB, OFB modes, there is an extra parameter: 'feedback size'. You can treat it as the result size of each AES block process. That means, CFB 8-bits mode should be about 16 times slower than CFB 128-bits mode. And also, you can do stream ciphers by using the CFB 8-bits mode.

You can reference the EfAesLib.pdf in the package for details about how the different block modes work.

Encode/Decode with same process Need Initial Vector Chain process

























AES always needs a 128-bit key to encrypt/decrypt. But it is also combined with an initial vector to work with, except in ECB mode. Each bit of the initial vector you use will double the possibilities of encrypted text from a given plain text, which means more safety.

EfAesLib supports ECB, CBC, PCBC, OFB, CFB, CRT block modes, and support OFB,CFB mode with [1..16] bytes feedback size. It also supports in-place encryption/decryption in each mode (source and destination buffer are the same).

The following sample uses Counter mode to encode a file:

#include "EfAes.h"
#include <fcntl.h>
#include <io.h>
#include <stdio.h>
#include <stdlib.h> 
int main(int argc , char * argv[])
    unsigned char key[16]={
    unsigned char vector[16]={
    unsigned char buff[4096];
    int rd_fd,wr_fd, rdsz;
    AesCtx context;
    AesSetKey( &context , AES_KEY_128BIT ,BLOCKMODE_CRT, key , vector );
    rd_fd = open("test.dat", O_RDONLY);
    wr_fd = open("test.encoded",O_WRONLY | O_CREAT);
    while( (rdsz = read(rd_fd, buff ,4096)) > 0 )
      // before last block , the block size
      // should always be the multiply of 16
      // the last block should be handled
      // if the size is not a multiply of 16
      AesEncryptCRT(&context , buff, buff, rdsz );
      rdsz = AesRoundSize( rdsz, 16);
      write( wr_fd , buff , rdsz );

The use of the AesCtx structure is mainly designed for thread issues. Each encryption session should have its own AesCtx. The EfAesLib APIs will always pad 0 to input data whose size is not a multiple of 16, or a multiple of the feedback size in the CFB, OFB modes.


There are pre-defined functions in the AES algorithm. The first step, also proposed in the Wiki, is to combine SubBytes, ShiftRows with MixColumns. The follow is my sample implementation:

void SubAndShiftAndMixRound(uint8 * pState ,uint32 * pRoundKey , uint32 * pOutput)
    uint32 a1,a2,a3,a4;


    *pOutput++ = 
        ((SboxXTime2[a1] ^ SboxXTime3[a2] ^        FSB[a3] ^        
                                                   FSB[a4])        |
               ((FSB[a1] ^ SboxXTime2[a2] ^ SboxXTime3[a3] ^        
                                            FSB[a4]) << 8)  |
               ((FSB[a1] ^        FSB[a2] ^ SboxXTime2[a3] ^ 
                                  SboxXTime3[a4]) << 16 )|
        ((SboxXTime3[a1] ^        FSB[a2] ^        FSB[a3] ^ 
                                  SboxXTime2[a4]) << 24))^ *pRoundKey++;


In the second step, notice the horizontal direction of a1, a2, a3, a4. We can reduce this by using a pre-build lookup table for each column.

    TestTable1[i]=SboxXTime2[i] | FSB_8[i]        | FSB_16[i]        | SboxXTime3_24[i];
    TestTable2[i]=SboxXTime3[i] | SboxXTime2_8[i] | FSB_16[i]        | FSB_24[i];
    TestTable3[i]=FSB[i]        | SboxXTime3_8[i] | SboxXTime2_16[i] | FSB_24[i];
    TestTable4[i]=FSB[i]        | FSB_8[i]        | SboxXTime3_16[i] | SboxXTime2_24[i];

The code in step one will be optimized to:

void SubAndShiftAndMixRound(uint8 * pState ,uint32 * pRoundKey , uint32 * pOutput)
    uint32 a1,a2,a3,a4;


     *pOutput++ = TestTable1[a1] ^ TestTable2[a2] ^ TestTable3[a3] ^ 
                                   TestTable4[a4] ^ *pRoundKey++;

In the third step, notice a1=pState[0],a2=pState[5],a3=pState[10],a4=pState[15]; it is slow in the 32-bit architecture. We can change it to a 32-bit access and XOR the sequence.


The best performance EfAesLib has is 10M bytes in 78 milliseconds with my Pentium IV 3.0Ghz computer.


The official document:

The Wiki


v2.0: Extended the library to 128/192/256 bits key length, and also added a 64 bit DLL in addition.


This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


About the Author

Engineer I will tell you after my death.
Taiwan Taiwan
No Biography provided

Comments and Discussions

Generalspot on. PinmemberKenSands29-Oct-14 9:50 
Bugnot "just plain 'C'." PinmemberMember 104430953-Dec-13 18:18 
QuestionGood Pinmembermicrobio756-Oct-13 22:12 
Questionbuggy v2.0 PinmemberPepekNamornik1-Dec-12 3:03 
GeneralMy vote of 5 Pinmembersukumarchandran25-Oct-12 0:20 
QuestionAESEncode.cpp seems to be corrupt PinmemberRobsterNZ11-Sep-12 14:37 
AnswerRe: AESEncode.cpp seems to be corrupt Pinmembermicrobio756-Oct-13 22:07 
Questionpretty good Pinmemberchenzhe6220-Apr-12 18:37 
QuestionCompilation errors Pinmembertinarajraj6-Feb-12 22:25 
GeneralMy vote of 5 PinmemberMonjurul Habib28-Dec-11 7:10 
Questionaes 256 cbc Pinmemberzby8472213-Dec-11 6:46 
GeneralExtension to use 256 bit keys PinmemberMemberPhillip18-Feb-10 17:24 
GeneralRe: Extension to use 256 bit keys PinmemberMemberPhillip18-Feb-10 17:33 
One other change required is to increase the array sizes in the various
chaining block functions.

That is, replace 44 with 60, e.g. in AesEncryptECB()

void AesEncryptECB( AesCtx * pContext , void * pOutput, void * pInput ,int iSize )
ALIGN uint32 a1,a2,a3,a4,state;
ALIGN uint32 local_temp[4];
#if 0
ALIGN uint32 local_key[44];
ALIGN uint32 local_key[60];

iSize = padding( pInput , iSize );

#if 0
memcpy( local_key , ((AESContext*)pContext)->AesEncKey , 44 * 4); // the key point is to declare array type.
memcpy( local_key , ((AESContext*)pContext)->AesEncKey , 60 * 4); // the key point is to declare array type.


AES_ENCRYPT( ((uint32*)pInput), ((uint32 *)pOutput),local_key,local_temp);
//AES_ENCRYPT_TEST( ((uint32*)pInput), ((uint32 *)pOutput),local_key);

pInput = (uint32 *) pInput + 4;
pOutput = (uint32 *) pOutput + 4;
iSize -= 16;


A more tidy approach would be to define the array size in a parameter, where
the 44 and 60 is equal to Nb*(Nr+1).
GeneralGood Job ! Pinmemberm.moestl12-Feb-10 3:00 
GeneralRe: Good Job ! Pinmemberrobertguan12-Feb-10 5:59 
GeneralCompleteness PinmemberPanic2k310-Feb-10 11:35 
GeneralRe: Completeness Pinmemberrobertguan10-Feb-10 15:30 
Generalmy vote of 5 PinmemberRozis9-Feb-10 13:56 
GeneralRe: my vote of 5 Pinmemberrobertguan9-Feb-10 20:16 
GeneralExcellent, thanks!! PinmemberTage Lejon9-Feb-10 9:18 
GeneralRe: Excellent, thanks!! Pinmemberrobertguan9-Feb-10 20:19 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.150414.5 | Last Updated 28 Dec 2011
Article Copyright 2010 by robertguan
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid