This library implements some hash and cryptographic algorithms.

Dependents:   mBuinoBlinky PB_Emma_Ethernet SLOTrashHTTP Garagem ... more

This library implements the following algorithms :

  • RC4
  • AES (AES-128, AES-192, AES-256)
  • DES
  • Triple DES (EDE)
  • MD2
  • MD4
  • MD5
  • SHA-1
  • SHA-2 (SHA-224, SHA-256, SHA-384, SHA-512)

The hash algorithms have been optimized for the mbed and you should get decent performance. However, I did not optimize the ciphers. Also, I did not test extensively these algorithms : it should work but you may find some bugs. Block ciphers support two modes : ECB and CBC.

Warning

If you are using SHA-384 or SHA-512, be aware that it produces large binary files and the compilation (using the online compiler) takes much longer to execute. It may happen that the compiler stops because it timed-out. In this case, just compile again and it should work.

Computing hash

You can compute the hash of some data in two different ways. The first one is the easiest, each hash algorithm has a static method that takes some data and compute the hash from it.

Computing hash using method 1

#include "Crypto.h"
#include "mbed.h"

static const char msg[] = "mbed is great !";

int main()
{
    uint8_t hash[16];
    MD2::computeHash(hash, (uint8_t*)msg, strlen(msg));
    printf("hash: ");
    for(int i = 0; i < 16; ++i)
        printf("%02x", hash[i]);
    printf("\n");
    
    return 0;
}

The second one is slightly slower (around 2-3% slower) but it allows you to compute the hash of some data in several steps (by calling update method). This is the method you should use if you need to compute the hash from a large source and you don't have enough memory to store it in a single buffer.

Computing hash using method 2

#include "Crypto.h"
#include "mbed.h"

static const char msg[] = "mbed is great !";

int main()
{
    uint8_t hash[16];
    MD2 h;
    h.update((uint8_t*)msg, strlen(msg));
    h.finalize(hash);
    printf("hash: ");
    for(int i = 0; i < 16; ++i)
        printf("%02x", hash[i]);
    printf("\n");
    
    return 0;
}

TODO

  • optimize ciphers
  • add doc
Committer:
feb11
Date:
Sun May 11 13:36:45 2014 +0000
Revision:
14:f04410cef037
Parent:
9:e34e076fb223
CBC mode completed

Who changed what in which revision?

UserRevisionLine numberNew contents of line
feb11 9:e34e076fb223 1 #ifndef MD4_H
feb11 9:e34e076fb223 2 #define MD4_H
feb11 9:e34e076fb223 3
feb11 9:e34e076fb223 4 #include "HashAlgorithm.h"
feb11 9:e34e076fb223 5
feb11 9:e34e076fb223 6 class MD4: public HashAlgorithm
feb11 9:e34e076fb223 7 {
feb11 9:e34e076fb223 8 public :
feb11 9:e34e076fb223 9
feb11 9:e34e076fb223 10 MD4();
feb11 9:e34e076fb223 11
feb11 9:e34e076fb223 12 virtual uint8_t outputSize() const;
feb11 9:e34e076fb223 13 virtual void update(uint8_t *data, uint32_t length);
feb11 9:e34e076fb223 14 virtual void finalize(uint8_t *hash);
feb11 9:e34e076fb223 15
feb11 9:e34e076fb223 16 static void computeHash(uint8_t *hash, uint8_t *data, uint32_t length);
feb11 9:e34e076fb223 17
feb11 9:e34e076fb223 18 private :
feb11 9:e34e076fb223 19
feb11 9:e34e076fb223 20 static void computeRounds(uint32_t *a2, uint32_t *b2, uint32_t *c2, uint32_t *d2, uint8_t *buffer);
feb11 9:e34e076fb223 21
feb11 9:e34e076fb223 22 uint32_t a,b,c,d;
feb11 9:e34e076fb223 23 uint32_t totalBufferLength;
feb11 9:e34e076fb223 24 uint8_t buffer[64];
feb11 9:e34e076fb223 25 uint8_t bufferLength;
feb11 9:e34e076fb223 26 };
feb11 9:e34e076fb223 27
feb11 9:e34e076fb223 28 #endif