1
0
mirror of https://github.com/trezor/trezor-firmware.git synced 2024-12-05 22:18:16 +00:00
trezor-firmware/crypto/ripemd160.c

357 lines
12 KiB
C
Raw Normal View History

#include "ripemd160.h"
#include <assert.h>
#include "memzero.h"
// Downlaoded from https://github.com/sipa/Coin25519/blob/master/src/crypto/ripemd160.c
// adapted by Pieter Wuille in 2012; all changes are in the public domain
2016-04-14 08:58:08 +00:00
/*
*
* RIPEMD160.c : RIPEMD-160 implementation
*
* Written in 2008 by Dwayne C. Litzenberger <dlitz@dlitz.net>
*
* ===================================================================
* The contents of this file are dedicated to the public domain. To
* the extent that dedication to the public domain is not available,
* everyone is granted a worldwide, perpetual, royalty-free,
* non-exclusive license to exercise all rights associated with the
* contents of this file for any purpose whatsoever.
* No rights are reserved.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
* ===================================================================
*
* Country of origin: Canada
2016-04-14 08:58:08 +00:00
*
* This implementation (written in C) is based on an implementation the author
* wrote in Python.
2016-04-14 08:58:08 +00:00
*
* This implementation was written with reference to the RIPEMD-160
* specification, which is available at:
* http://homes.esat.kuleuven.be/~cosicart/pdf/AB-9601/
2016-04-14 08:58:08 +00:00
*
* It is also documented in the _Handbook of Applied Cryptography_, as
* Algorithm 9.55. It's on page 30 of the following PDF file:
* http://www.cacr.math.uwaterloo.ca/hac/about/chap9.pdf
2016-04-14 08:58:08 +00:00
*
* The RIPEMD-160 specification doesn't really tell us how to do padding, but
* since RIPEMD-160 is inspired by MD4, you can use the padding algorithm from
* RFC 1320.
*
* According to http://www.users.zetnet.co.uk/hopwood/crypto/scan/md.html:
* "RIPEMD-160 is big-bit-endian, little-byte-endian, and left-justified."
2016-04-14 08:58:08 +00:00
*/
#include <stdint.h>
2013-09-15 23:32:56 +00:00
2016-04-14 08:58:08 +00:00
#include <string.h>
#define RIPEMD160_DIGEST_SIZE RIPEMD160_DIGEST_LENGTH
2017-08-10 13:49:12 +00:00
/* cyclic left-shift the 32-bit word n left by s bits */
#define ROL(s, n) (((n) << (s)) | ((n) >> (32-(s))))
/* Initial values for the chaining variables.
* This is just 0123456789ABCDEFFEDCBA9876543210F0E1D2C3 in little-endian. */
static const uint32_t initial_h[5] = { 0x67452301u, 0xEFCDAB89u, 0x98BADCFEu, 0x10325476u, 0xC3D2E1F0u };
/* Ordering of message words. Based on the permutations rho(i) and pi(i), defined as follows:
*
* rho(i) := { 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8 }[i] 0 <= i <= 15
*
* pi(i) := 9*i + 5 (mod 16)
*
* Line | Round 1 | Round 2 | Round 3 | Round 4 | Round 5
* -------+-----------+-----------+-----------+-----------+-----------
* left | id | rho | rho^2 | rho^3 | rho^4
* right | pi | rho pi | rho^2 pi | rho^3 pi | rho^4 pi
2016-04-14 08:58:08 +00:00
*/
/* Left line */
static const uint8_t RL[5][16] = {
{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }, /* Round 1: id */
{ 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8 }, /* Round 2: rho */
{ 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12 }, /* Round 3: rho^2 */
{ 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2 }, /* Round 4: rho^3 */
{ 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13 } /* Round 5: rho^4 */
};
/* Right line */
static const uint8_t RR[5][16] = {
{ 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12 }, /* Round 1: pi */
{ 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2 }, /* Round 2: rho pi */
{ 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13 }, /* Round 3: rho^2 pi */
{ 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14 }, /* Round 4: rho^3 pi */
{ 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11 } /* Round 5: rho^4 pi */
};
2016-04-14 08:58:08 +00:00
/*
* Shifts - Since we don't actually re-order the message words according to
* the permutations above (we could, but it would be slower), these tables
* come with the permutations pre-applied.
2016-04-14 08:58:08 +00:00
*/
/* Shifts, left line */
static const uint8_t SL[5][16] = {
{ 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8 }, /* Round 1 */
{ 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12 }, /* Round 2 */
{ 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5 }, /* Round 3 */
{ 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12 }, /* Round 4 */
{ 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 } /* Round 5 */
};
/* Shifts, right line */
static const uint8_t SR[5][16] = {
{ 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6 }, /* Round 1 */
{ 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11 }, /* Round 2 */
{ 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5 }, /* Round 3 */
{ 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8 }, /* Round 4 */
{ 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 } /* Round 5 */
};
/* Boolean functions */
#define F1(x, y, z) ((x) ^ (y) ^ (z))
#define F2(x, y, z) (((x) & (y)) | (~(x) & (z)))
#define F3(x, y, z) (((x) | ~(y)) ^ (z))
#define F4(x, y, z) (((x) & (z)) | ((y) & ~(z)))
#define F5(x, y, z) ((x) ^ ((y) | ~(z)))
/* Round constants, left line */
static const uint32_t KL[5] = {
0x00000000u, /* Round 1: 0 */
0x5A827999u, /* Round 2: floor(2**30 * sqrt(2)) */
0x6ED9EBA1u, /* Round 3: floor(2**30 * sqrt(3)) */
0x8F1BBCDCu, /* Round 4: floor(2**30 * sqrt(5)) */
0xA953FD4Eu /* Round 5: floor(2**30 * sqrt(7)) */
};
/* Round constants, right line */
static const uint32_t KR[5] = {
0x50A28BE6u, /* Round 1: floor(2**30 * cubert(2)) */
0x5C4DD124u, /* Round 2: floor(2**30 * cubert(3)) */
0x6D703EF3u, /* Round 3: floor(2**30 * cubert(5)) */
0x7A6D76E9u, /* Round 4: floor(2**30 * cubert(7)) */
0x00000000u /* Round 5: 0 */
};
void ripemd160_init(ripemd160_state *self)
2016-04-14 08:58:08 +00:00
{
memcpy(self->h, initial_h, RIPEMD160_DIGEST_SIZE);
memset(&self->buf, 0, sizeof(self->buf));
self->length = 0;
self->bufpos = 0;
2016-04-14 08:58:08 +00:00
}
#ifdef PCT_BIG_ENDIAN
static inline void byteswap32(uint32_t *v)
2016-04-14 08:58:08 +00:00
{
union { uint32_t w; uint8_t b[4]; } x = {0}, y = {0};
x.w = *v;
y.b[0] = x.b[3];
y.b[1] = x.b[2];
y.b[2] = x.b[1];
y.b[3] = x.b[0];
*v = y.w;
/* Wipe temporary variables */
x.w = y.w = 0;
2016-04-14 08:58:08 +00:00
}
static inline void byteswap_digest(uint32_t *p)
2013-09-15 23:32:56 +00:00
{
unsigned int i = 0;
2016-04-14 08:58:08 +00:00
for (i = 0; i < 4; i++) {
byteswap32(p++);
byteswap32(p++);
byteswap32(p++);
byteswap32(p++);
}
}
#endif
2016-04-14 08:58:08 +00:00
/* The RIPEMD160 compression function. Operates on self->buf */
static void ripemd160_compress(ripemd160_state *self)
{
uint8_t w = 0, round = 0;
uint32_t T = 0;
uint32_t AL = 0, BL = 0, CL = 0, DL = 0, EL = 0; /* left line */
uint32_t AR = 0, BR = 0, CR = 0, DR = 0, ER = 0; /* right line */
2016-04-14 08:58:08 +00:00
/* Sanity check */
assert(self->bufpos == 64);
2016-04-14 08:58:08 +00:00
/* Byte-swap the buffer if we're on a big-endian machine */
#ifdef PCT_BIG_ENDIAN
byteswap_digest(self->buf.w);
#endif
2016-04-14 08:58:08 +00:00
/* Load the left and right lines with the initial state */
AL = AR = self->h[0];
BL = BR = self->h[1];
CL = CR = self->h[2];
DL = DR = self->h[3];
EL = ER = self->h[4];
/* Round 1 */
round = 0;
for (w = 0; w < 16; w++) { /* left line */
T = ROL(SL[round][w], AL + F1(BL, CL, DL) + self->buf.w[RL[round][w]] + KL[round]) + EL;
AL = EL; EL = DL; DL = ROL(10, CL); CL = BL; BL = T;
}
for (w = 0; w < 16; w++) { /* right line */
T = ROL(SR[round][w], AR + F5(BR, CR, DR) + self->buf.w[RR[round][w]] + KR[round]) + ER;
AR = ER; ER = DR; DR = ROL(10, CR); CR = BR; BR = T;
2016-04-14 08:58:08 +00:00
}
/* Round 2 */
round++;
for (w = 0; w < 16; w++) { /* left line */
T = ROL(SL[round][w], AL + F2(BL, CL, DL) + self->buf.w[RL[round][w]] + KL[round]) + EL;
AL = EL; EL = DL; DL = ROL(10, CL); CL = BL; BL = T;
}
for (w = 0; w < 16; w++) { /* right line */
T = ROL(SR[round][w], AR + F4(BR, CR, DR) + self->buf.w[RR[round][w]] + KR[round]) + ER;
AR = ER; ER = DR; DR = ROL(10, CR); CR = BR; BR = T;
2016-04-14 08:58:08 +00:00
}
/* Round 3 */
round++;
for (w = 0; w < 16; w++) { /* left line */
T = ROL(SL[round][w], AL + F3(BL, CL, DL) + self->buf.w[RL[round][w]] + KL[round]) + EL;
AL = EL; EL = DL; DL = ROL(10, CL); CL = BL; BL = T;
}
for (w = 0; w < 16; w++) { /* right line */
T = ROL(SR[round][w], AR + F3(BR, CR, DR) + self->buf.w[RR[round][w]] + KR[round]) + ER;
AR = ER; ER = DR; DR = ROL(10, CR); CR = BR; BR = T;
2016-04-14 08:58:08 +00:00
}
/* Round 4 */
round++;
for (w = 0; w < 16; w++) { /* left line */
T = ROL(SL[round][w], AL + F4(BL, CL, DL) + self->buf.w[RL[round][w]] + KL[round]) + EL;
AL = EL; EL = DL; DL = ROL(10, CL); CL = BL; BL = T;
}
for (w = 0; w < 16; w++) { /* right line */
T = ROL(SR[round][w], AR + F2(BR, CR, DR) + self->buf.w[RR[round][w]] + KR[round]) + ER;
AR = ER; ER = DR; DR = ROL(10, CR); CR = BR; BR = T;
}
2016-04-14 08:58:08 +00:00
/* Round 5 */
round++;
for (w = 0; w < 16; w++) { /* left line */
T = ROL(SL[round][w], AL + F5(BL, CL, DL) + self->buf.w[RL[round][w]] + KL[round]) + EL;
AL = EL; EL = DL; DL = ROL(10, CL); CL = BL; BL = T;
}
for (w = 0; w < 16; w++) { /* right line */
T = ROL(SR[round][w], AR + F1(BR, CR, DR) + self->buf.w[RR[round][w]] + KR[round]) + ER;
AR = ER; ER = DR; DR = ROL(10, CR); CR = BR; BR = T;
}
2016-04-14 08:58:08 +00:00
/* Final mixing stage */
T = self->h[1] + CL + DR;
self->h[1] = self->h[2] + DL + ER;
self->h[2] = self->h[3] + EL + AR;
self->h[3] = self->h[4] + AL + BR;
self->h[4] = self->h[0] + BL + CR;
self->h[0] = T;
/* Clear the buffer and wipe the temporary variables */
memzero(&self->buf, sizeof(self->buf));
memzero(&T, sizeof(T));
memzero(&AL, sizeof(AL));
memzero(&BL, sizeof(BL));
memzero(&CL, sizeof(CL));
memzero(&DL, sizeof(DL));
memzero(&EL, sizeof(EL));
memzero(&AR, sizeof(AR));
memzero(&BR, sizeof(BR));
memzero(&CR, sizeof(CR));
memzero(&DR, sizeof(DR));
memzero(&ER, sizeof(ER));
self->bufpos = 0;
}
2016-04-14 08:58:08 +00:00
void ripemd160_process(ripemd160_state * self, const uint8_t *p, size_t length)
{
unsigned long bytes_needed = 0;
/* Some assertions */
assert(p != NULL);
/* We never leave a full buffer */
assert(self->bufpos < 64);
while (length > 0) {
/* Figure out how many bytes we need to fill the internal buffer. */
bytes_needed = 64 - self->bufpos;
if ((unsigned long) length >= bytes_needed) {
/* We have enough bytes, so copy them into the internal buffer and run
* the compression function. */
memcpy(&self->buf.b[self->bufpos], p, bytes_needed);
self->bufpos += bytes_needed;
self->length += bytes_needed << 3; /* length is in bits */
p += bytes_needed;
ripemd160_compress(self);
length -= bytes_needed;
continue;
}
/* We do not have enough bytes to fill the internal buffer.
* Copy what's there and return. */
memcpy(&self->buf.b[self->bufpos], p, length);
self->bufpos += length;
self->length += length << 3; /* length is in bits */
return;
}
}
2016-04-14 08:58:08 +00:00
void ripemd160_done(ripemd160_state * self, uint8_t out[RIPEMD160_DIGEST_LENGTH])
{
/* Append the padding */
self->buf.b[self->bufpos++] = 0x80;
2016-04-14 08:58:08 +00:00
if (self->bufpos > 56) {
self->bufpos = 64;
ripemd160_compress(self);
}
2016-04-14 08:58:08 +00:00
/* Append the length */
self->buf.w[14] = (uint32_t) (self->length & 0xFFFFffffu);
self->buf.w[15] = (uint32_t) ((self->length >> 32) & 0xFFFFffffu);
#ifdef PCT_BIG_ENDIAN
byteswap32(&self->buf.w[14]);
byteswap32(&self->buf.w[15]);
#endif
self->bufpos = 64;
ripemd160_compress(self);
2017-08-10 13:49:12 +00:00
/* Copy the final state into the output buffer */
#ifdef PCT_BIG_ENDIAN
byteswap_digest(self->h);
#endif
memcpy(out, &self->h, RIPEMD160_DIGEST_SIZE);
memzero(self, sizeof(ripemd160_state));
2013-09-15 23:32:56 +00:00
}
void ripemd160(const uint8_t *in, size_t length, uint8_t out[RIPEMD160_DIGEST_LENGTH])
2013-09-15 23:32:56 +00:00
{
ripemd160_state md = {0};
ripemd160_init(&md);
ripemd160_process(&md, in, length);
ripemd160_done(&md, out);
2013-09-15 23:32:56 +00:00
}