aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorYawning Angel <yawning@schwanenlied.me>2023-11-16 11:13:42 +0900
committerYawning Angel <yawning@schwanenlied.me>2023-11-17 16:53:29 +0900
commit9d627e453adb2d26bc133fdff6e180851ad8ab9c (patch)
treef3ced1d782c2cc0dbbbbb9e786a1ef0b944a1bbc
parentd6e0e5d3f64056f70da82a272e94bc1a4a79d1ee (diff)
core/crypto/md5: odinfmt (NFC)
-rw-r--r--core/crypto/md5/md5.odin377
1 files changed, 189 insertions, 188 deletions
diff --git a/core/crypto/md5/md5.odin b/core/crypto/md5/md5.odin
index 858480b04..0b04916dc 100644
--- a/core/crypto/md5/md5.odin
+++ b/core/crypto/md5/md5.odin
@@ -10,9 +10,9 @@ package md5
Implementation of the MD5 hashing algorithm, as defined in RFC 1321 <https://datatracker.ietf.org/doc/html/rfc1321>
*/
+import "core:io"
import "core:mem"
import "core:os"
-import "core:io"
import "../util"
@@ -25,77 +25,77 @@ DIGEST_SIZE :: 16
// hash_string will hash the given input and return the
// computed hash
hash_string :: proc(data: string) -> [DIGEST_SIZE]byte {
- return hash_bytes(transmute([]byte)(data))
+ return hash_bytes(transmute([]byte)(data))
}
// hash_bytes will hash the given input and return the
// computed hash
hash_bytes :: proc(data: []byte) -> [DIGEST_SIZE]byte {
- hash: [DIGEST_SIZE]byte
- ctx: Md5_Context
- init(&ctx)
- update(&ctx, data)
- final(&ctx, hash[:])
- return hash
+ hash: [DIGEST_SIZE]byte
+ ctx: Md5_Context
+ init(&ctx)
+ update(&ctx, data)
+ final(&ctx, hash[:])
+ return hash
}
// hash_string_to_buffer will hash the given input and assign the
// computed hash to the second parameter.
// It requires that the destination buffer is at least as big as the digest size
hash_string_to_buffer :: proc(data: string, hash: []byte) {
- hash_bytes_to_buffer(transmute([]byte)(data), hash)
+ hash_bytes_to_buffer(transmute([]byte)(data), hash)
}
// hash_bytes_to_buffer will hash the given input and write the
// computed hash into the second parameter.
// It requires that the destination buffer is at least as big as the digest size
hash_bytes_to_buffer :: proc(data, hash: []byte) {
- assert(len(hash) >= DIGEST_SIZE, "Size of destination buffer is smaller than the digest size")
- ctx: Md5_Context
- init(&ctx)
- update(&ctx, data)
- final(&ctx, hash)
+ assert(len(hash) >= DIGEST_SIZE, "Size of destination buffer is smaller than the digest size")
+ ctx: Md5_Context
+ init(&ctx)
+ update(&ctx, data)
+ final(&ctx, hash)
}
// hash_stream will read the stream in chunks and compute a
// hash from its contents
hash_stream :: proc(s: io.Stream) -> ([DIGEST_SIZE]byte, bool) {
- hash: [DIGEST_SIZE]byte
- ctx: Md5_Context
- init(&ctx)
- buf := make([]byte, 512)
- defer delete(buf)
- read := 1
- for read > 0 {
- read, _ = io.read(s, buf)
- if read > 0 {
- update(&ctx, buf[:read])
- }
- }
- final(&ctx, hash[:])
- return hash, true
+ hash: [DIGEST_SIZE]byte
+ ctx: Md5_Context
+ init(&ctx)
+ buf := make([]byte, 512)
+ defer delete(buf)
+ read := 1
+ for read > 0 {
+ read, _ = io.read(s, buf)
+ if read > 0 {
+ update(&ctx, buf[:read])
+ }
+ }
+ final(&ctx, hash[:])
+ return hash, true
}
// hash_file will read the file provided by the given handle
// and compute a hash
hash_file :: proc(hd: os.Handle, load_at_once := false) -> ([DIGEST_SIZE]byte, bool) {
- if !load_at_once {
- return hash_stream(os.stream_from_handle(hd))
- } else {
- if buf, ok := os.read_entire_file(hd); ok {
- return hash_bytes(buf[:]), ok
- }
- }
- return [DIGEST_SIZE]byte{}, false
+ if !load_at_once {
+ return hash_stream(os.stream_from_handle(hd))
+ } else {
+ if buf, ok := os.read_entire_file(hd); ok {
+ return hash_bytes(buf[:]), ok
+ }
+ }
+ return [DIGEST_SIZE]byte{}, false
}
hash :: proc {
- hash_stream,
- hash_file,
- hash_bytes,
- hash_string,
- hash_bytes_to_buffer,
- hash_string_to_buffer,
+ hash_stream,
+ hash_file,
+ hash_bytes,
+ hash_string,
+ hash_bytes_to_buffer,
+ hash_string_to_buffer,
}
/*
@@ -103,76 +103,76 @@ hash :: proc {
*/
init :: proc(ctx: ^Md5_Context) {
- ctx.state[0] = 0x67452301
- ctx.state[1] = 0xefcdab89
- ctx.state[2] = 0x98badcfe
- ctx.state[3] = 0x10325476
+ ctx.state[0] = 0x67452301
+ ctx.state[1] = 0xefcdab89
+ ctx.state[2] = 0x98badcfe
+ ctx.state[3] = 0x10325476
}
update :: proc(ctx: ^Md5_Context, data: []byte) {
- for i := 0; i < len(data); i += 1 {
- ctx.data[ctx.datalen] = data[i]
- ctx.datalen += 1
- if(ctx.datalen == BLOCK_SIZE) {
- transform(ctx, ctx.data[:])
- ctx.bitlen += 512
- ctx.datalen = 0
- }
- }
+ for i := 0; i < len(data); i += 1 {
+ ctx.data[ctx.datalen] = data[i]
+ ctx.datalen += 1
+ if (ctx.datalen == BLOCK_SIZE) {
+ transform(ctx, ctx.data[:])
+ ctx.bitlen += 512
+ ctx.datalen = 0
+ }
+ }
}
-final :: proc(ctx: ^Md5_Context, hash: []byte){
- i : u32
- i = ctx.datalen
-
- if ctx.datalen < 56 {
- ctx.data[i] = 0x80
- i += 1
- for i < 56 {
- ctx.data[i] = 0x00
- i += 1
- }
- } else if ctx.datalen >= 56 {
- ctx.data[i] = 0x80
- i += 1
- for i < BLOCK_SIZE {
- ctx.data[i] = 0x00
- i += 1
- }
- transform(ctx, ctx.data[:])
- mem.set(&ctx.data, 0, 56)
- }
-
- ctx.bitlen += u64(ctx.datalen * 8)
- ctx.data[56] = byte(ctx.bitlen)
- ctx.data[57] = byte(ctx.bitlen >> 8)
- ctx.data[58] = byte(ctx.bitlen >> 16)
- ctx.data[59] = byte(ctx.bitlen >> 24)
- ctx.data[60] = byte(ctx.bitlen >> 32)
- ctx.data[61] = byte(ctx.bitlen >> 40)
- ctx.data[62] = byte(ctx.bitlen >> 48)
- ctx.data[63] = byte(ctx.bitlen >> 56)
- transform(ctx, ctx.data[:])
-
- for i = 0; i < 4; i += 1 {
- hash[i] = byte(ctx.state[0] >> (i * 8)) & 0x000000ff
- hash[i + 4] = byte(ctx.state[1] >> (i * 8)) & 0x000000ff
- hash[i + 8] = byte(ctx.state[2] >> (i * 8)) & 0x000000ff
- hash[i + 12] = byte(ctx.state[3] >> (i * 8)) & 0x000000ff
- }
+final :: proc(ctx: ^Md5_Context, hash: []byte) {
+ i: u32
+ i = ctx.datalen
+
+ if ctx.datalen < 56 {
+ ctx.data[i] = 0x80
+ i += 1
+ for i < 56 {
+ ctx.data[i] = 0x00
+ i += 1
+ }
+ } else if ctx.datalen >= 56 {
+ ctx.data[i] = 0x80
+ i += 1
+ for i < BLOCK_SIZE {
+ ctx.data[i] = 0x00
+ i += 1
+ }
+ transform(ctx, ctx.data[:])
+ mem.set(&ctx.data, 0, 56)
+ }
+
+ ctx.bitlen += u64(ctx.datalen * 8)
+ ctx.data[56] = byte(ctx.bitlen)
+ ctx.data[57] = byte(ctx.bitlen >> 8)
+ ctx.data[58] = byte(ctx.bitlen >> 16)
+ ctx.data[59] = byte(ctx.bitlen >> 24)
+ ctx.data[60] = byte(ctx.bitlen >> 32)
+ ctx.data[61] = byte(ctx.bitlen >> 40)
+ ctx.data[62] = byte(ctx.bitlen >> 48)
+ ctx.data[63] = byte(ctx.bitlen >> 56)
+ transform(ctx, ctx.data[:])
+
+ for i = 0; i < 4; i += 1 {
+ hash[i] = byte(ctx.state[0] >> (i * 8)) & 0x000000ff
+ hash[i + 4] = byte(ctx.state[1] >> (i * 8)) & 0x000000ff
+ hash[i + 8] = byte(ctx.state[2] >> (i * 8)) & 0x000000ff
+ hash[i + 12] = byte(ctx.state[3] >> (i * 8)) & 0x000000ff
+ }
}
/*
MD4 implementation
*/
-BLOCK_SIZE :: 64
+BLOCK_SIZE :: 64
Md5_Context :: struct {
- data: [BLOCK_SIZE]byte,
- state: [4]u32,
- bitlen: u64,
- datalen: u32,
+ data: [BLOCK_SIZE]byte,
+ state: [4]u32,
+ bitlen: u64,
+ datalen: u32,
}
/*
@@ -181,105 +181,106 @@ Md5_Context :: struct {
*/
FF :: #force_inline proc "contextless" (a, b, c, d, m: u32, s: int, t: u32) -> u32 {
- return b + util.ROTL32(a + ((b & c) | (~b & d)) + m + t, s)
+ return b + util.ROTL32(a + ((b & c) | (~b & d)) + m + t, s)
}
GG :: #force_inline proc "contextless" (a, b, c, d, m: u32, s: int, t: u32) -> u32 {
- return b + util.ROTL32(a + ((b & d) | (c & ~d)) + m + t, s)
+ return b + util.ROTL32(a + ((b & d) | (c & ~d)) + m + t, s)
}
HH :: #force_inline proc "contextless" (a, b, c, d, m: u32, s: int, t: u32) -> u32 {
- return b + util.ROTL32(a + (b ~ c ~ d) + m + t, s)
+ return b + util.ROTL32(a + (b ~ c ~ d) + m + t, s)
}
II :: #force_inline proc "contextless" (a, b, c, d, m: u32, s: int, t: u32) -> u32 {
- return b + util.ROTL32(a + (c ~ (b | ~d)) + m + t, s)
+ return b + util.ROTL32(a + (c ~ (b | ~d)) + m + t, s)
}
transform :: proc(ctx: ^Md5_Context, data: []byte) {
- i, j: u32
- m: [DIGEST_SIZE]u32
-
- for i, j = 0, 0; i < DIGEST_SIZE; i+=1 {
- m[i] = u32(data[j]) + u32(data[j + 1]) << 8 + u32(data[j + 2]) << 16 + u32(data[j + 3]) << 24
- j += 4
- }
-
- a := ctx.state[0]
- b := ctx.state[1]
- c := ctx.state[2]
- d := ctx.state[3]
-
- a = FF(a, b, c, d, m[0], 7, 0xd76aa478)
- d = FF(d, a, b, c, m[1], 12, 0xe8c7b756)
- c = FF(c, d, a, b, m[2], 17, 0x242070db)
- b = FF(b, c, d, a, m[3], 22, 0xc1bdceee)
- a = FF(a, b, c, d, m[4], 7, 0xf57c0faf)
- d = FF(d, a, b, c, m[5], 12, 0x4787c62a)
- c = FF(c, d, a, b, m[6], 17, 0xa8304613)
- b = FF(b, c, d, a, m[7], 22, 0xfd469501)
- a = FF(a, b, c, d, m[8], 7, 0x698098d8)
- d = FF(d, a, b, c, m[9], 12, 0x8b44f7af)
- c = FF(c, d, a, b, m[10], 17, 0xffff5bb1)
- b = FF(b, c, d, a, m[11], 22, 0x895cd7be)
- a = FF(a, b, c, d, m[12], 7, 0x6b901122)
- d = FF(d, a, b, c, m[13], 12, 0xfd987193)
- c = FF(c, d, a, b, m[14], 17, 0xa679438e)
- b = FF(b, c, d, a, m[15], 22, 0x49b40821)
-
- a = GG(a, b, c, d, m[1], 5, 0xf61e2562)
- d = GG(d, a, b, c, m[6], 9, 0xc040b340)
- c = GG(c, d, a, b, m[11], 14, 0x265e5a51)
- b = GG(b, c, d, a, m[0], 20, 0xe9b6c7aa)
- a = GG(a, b, c, d, m[5], 5, 0xd62f105d)
- d = GG(d, a, b, c, m[10], 9, 0x02441453)
- c = GG(c, d, a, b, m[15], 14, 0xd8a1e681)
- b = GG(b, c, d, a, m[4], 20, 0xe7d3fbc8)
- a = GG(a, b, c, d, m[9], 5, 0x21e1cde6)
- d = GG(d, a, b, c, m[14], 9, 0xc33707d6)
- c = GG(c, d, a, b, m[3], 14, 0xf4d50d87)
- b = GG(b, c, d, a, m[8], 20, 0x455a14ed)
- a = GG(a, b, c, d, m[13], 5, 0xa9e3e905)
- d = GG(d, a, b, c, m[2], 9, 0xfcefa3f8)
- c = GG(c, d, a, b, m[7], 14, 0x676f02d9)
- b = GG(b, c, d, a, m[12], 20, 0x8d2a4c8a)
-
- a = HH(a, b, c, d, m[5], 4, 0xfffa3942)
- d = HH(d, a, b, c, m[8], 11, 0x8771f681)
- c = HH(c, d, a, b, m[11], 16, 0x6d9d6122)
- b = HH(b, c, d, a, m[14], 23, 0xfde5380c)
- a = HH(a, b, c, d, m[1], 4, 0xa4beea44)
- d = HH(d, a, b, c, m[4], 11, 0x4bdecfa9)
- c = HH(c, d, a, b, m[7], 16, 0xf6bb4b60)
- b = HH(b, c, d, a, m[10], 23, 0xbebfbc70)
- a = HH(a, b, c, d, m[13], 4, 0x289b7ec6)
- d = HH(d, a, b, c, m[0], 11, 0xeaa127fa)
- c = HH(c, d, a, b, m[3], 16, 0xd4ef3085)
- b = HH(b, c, d, a, m[6], 23, 0x04881d05)
- a = HH(a, b, c, d, m[9], 4, 0xd9d4d039)
- d = HH(d, a, b, c, m[12], 11, 0xe6db99e5)
- c = HH(c, d, a, b, m[15], 16, 0x1fa27cf8)
- b = HH(b, c, d, a, m[2], 23, 0xc4ac5665)
-
- a = II(a, b, c, d, m[0], 6, 0xf4292244)
- d = II(d, a, b, c, m[7], 10, 0x432aff97)
- c = II(c, d, a, b, m[14], 15, 0xab9423a7)
- b = II(b, c, d, a, m[5], 21, 0xfc93a039)
- a = II(a, b, c, d, m[12], 6, 0x655b59c3)
- d = II(d, a, b, c, m[3], 10, 0x8f0ccc92)
- c = II(c, d, a, b, m[10], 15, 0xffeff47d)
- b = II(b, c, d, a, m[1], 21, 0x85845dd1)
- a = II(a, b, c, d, m[8], 6, 0x6fa87e4f)
- d = II(d, a, b, c, m[15], 10, 0xfe2ce6e0)
- c = II(c, d, a, b, m[6], 15, 0xa3014314)
- b = II(b, c, d, a, m[13], 21, 0x4e0811a1)
- a = II(a, b, c, d, m[4], 6, 0xf7537e82)
- d = II(d, a, b, c, m[11], 10, 0xbd3af235)
- c = II(c, d, a, b, m[2], 15, 0x2ad7d2bb)
- b = II(b, c, d, a, m[9], 21, 0xeb86d391)
-
- ctx.state[0] += a
- ctx.state[1] += b
- ctx.state[2] += c
- ctx.state[3] += d
+ i, j: u32
+ m: [DIGEST_SIZE]u32
+
+ for i, j = 0, 0; i < DIGEST_SIZE; i += 1 {
+ m[i] =
+ u32(data[j]) + u32(data[j + 1]) << 8 + u32(data[j + 2]) << 16 + u32(data[j + 3]) << 24
+ j += 4
+ }
+
+ a := ctx.state[0]
+ b := ctx.state[1]
+ c := ctx.state[2]
+ d := ctx.state[3]
+
+ a = FF(a, b, c, d, m[0], 7, 0xd76aa478)
+ d = FF(d, a, b, c, m[1], 12, 0xe8c7b756)
+ c = FF(c, d, a, b, m[2], 17, 0x242070db)
+ b = FF(b, c, d, a, m[3], 22, 0xc1bdceee)
+ a = FF(a, b, c, d, m[4], 7, 0xf57c0faf)
+ d = FF(d, a, b, c, m[5], 12, 0x4787c62a)
+ c = FF(c, d, a, b, m[6], 17, 0xa8304613)
+ b = FF(b, c, d, a, m[7], 22, 0xfd469501)
+ a = FF(a, b, c, d, m[8], 7, 0x698098d8)
+ d = FF(d, a, b, c, m[9], 12, 0x8b44f7af)
+ c = FF(c, d, a, b, m[10], 17, 0xffff5bb1)
+ b = FF(b, c, d, a, m[11], 22, 0x895cd7be)
+ a = FF(a, b, c, d, m[12], 7, 0x6b901122)
+ d = FF(d, a, b, c, m[13], 12, 0xfd987193)
+ c = FF(c, d, a, b, m[14], 17, 0xa679438e)
+ b = FF(b, c, d, a, m[15], 22, 0x49b40821)
+
+ a = GG(a, b, c, d, m[1], 5, 0xf61e2562)
+ d = GG(d, a, b, c, m[6], 9, 0xc040b340)
+ c = GG(c, d, a, b, m[11], 14, 0x265e5a51)
+ b = GG(b, c, d, a, m[0], 20, 0xe9b6c7aa)
+ a = GG(a, b, c, d, m[5], 5, 0xd62f105d)
+ d = GG(d, a, b, c, m[10], 9, 0x02441453)
+ c = GG(c, d, a, b, m[15], 14, 0xd8a1e681)
+ b = GG(b, c, d, a, m[4], 20, 0xe7d3fbc8)
+ a = GG(a, b, c, d, m[9], 5, 0x21e1cde6)
+ d = GG(d, a, b, c, m[14], 9, 0xc33707d6)
+ c = GG(c, d, a, b, m[3], 14, 0xf4d50d87)
+ b = GG(b, c, d, a, m[8], 20, 0x455a14ed)
+ a = GG(a, b, c, d, m[13], 5, 0xa9e3e905)
+ d = GG(d, a, b, c, m[2], 9, 0xfcefa3f8)
+ c = GG(c, d, a, b, m[7], 14, 0x676f02d9)
+ b = GG(b, c, d, a, m[12], 20, 0x8d2a4c8a)
+
+ a = HH(a, b, c, d, m[5], 4, 0xfffa3942)
+ d = HH(d, a, b, c, m[8], 11, 0x8771f681)
+ c = HH(c, d, a, b, m[11], 16, 0x6d9d6122)
+ b = HH(b, c, d, a, m[14], 23, 0xfde5380c)
+ a = HH(a, b, c, d, m[1], 4, 0xa4beea44)
+ d = HH(d, a, b, c, m[4], 11, 0x4bdecfa9)
+ c = HH(c, d, a, b, m[7], 16, 0xf6bb4b60)
+ b = HH(b, c, d, a, m[10], 23, 0xbebfbc70)
+ a = HH(a, b, c, d, m[13], 4, 0x289b7ec6)
+ d = HH(d, a, b, c, m[0], 11, 0xeaa127fa)
+ c = HH(c, d, a, b, m[3], 16, 0xd4ef3085)
+ b = HH(b, c, d, a, m[6], 23, 0x04881d05)
+ a = HH(a, b, c, d, m[9], 4, 0xd9d4d039)
+ d = HH(d, a, b, c, m[12], 11, 0xe6db99e5)
+ c = HH(c, d, a, b, m[15], 16, 0x1fa27cf8)
+ b = HH(b, c, d, a, m[2], 23, 0xc4ac5665)
+
+ a = II(a, b, c, d, m[0], 6, 0xf4292244)
+ d = II(d, a, b, c, m[7], 10, 0x432aff97)
+ c = II(c, d, a, b, m[14], 15, 0xab9423a7)
+ b = II(b, c, d, a, m[5], 21, 0xfc93a039)
+ a = II(a, b, c, d, m[12], 6, 0x655b59c3)
+ d = II(d, a, b, c, m[3], 10, 0x8f0ccc92)
+ c = II(c, d, a, b, m[10], 15, 0xffeff47d)
+ b = II(b, c, d, a, m[1], 21, 0x85845dd1)
+ a = II(a, b, c, d, m[8], 6, 0x6fa87e4f)
+ d = II(d, a, b, c, m[15], 10, 0xfe2ce6e0)
+ c = II(c, d, a, b, m[6], 15, 0xa3014314)
+ b = II(b, c, d, a, m[13], 21, 0x4e0811a1)
+ a = II(a, b, c, d, m[4], 6, 0xf7537e82)
+ d = II(d, a, b, c, m[11], 10, 0xbd3af235)
+ c = II(c, d, a, b, m[2], 15, 0x2ad7d2bb)
+ b = II(b, c, d, a, m[9], 21, 0xeb86d391)
+
+ ctx.state[0] += a
+ ctx.state[1] += b
+ ctx.state[2] += c
+ ctx.state[3] += d
}