1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/vlib/crypto/md5/md5.v

146 lines
3.3 KiB
V
Raw Normal View History

2019-07-16 15:20:51 +03:00
// Copyright (c) 2019 Alexander Medvednikov. All rights reserved.
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
// Package md5 implements the MD5 hash algorithm as defined in RFC 1321.
// MD5 is cryptographically broken and should not be used for secure
// applications.
// Based off: https://github.com/golang/go/blob/master/src/crypto/md5
// Last commit: https://github.com/golang/go/commit/ed7f323c8f4f6bc61a75146bf34f5b8f73063a17
2019-07-16 15:20:51 +03:00
module md5
import encoding.binary
const (
// The size of an MD5 checksum in bytes.
Size = 16
// The blocksize of MD5 in bytes.
BlockSize = 64
)
const (
Init0 = 0x67452301
Init1 = 0xEFCDAB89
Init2 = 0x98BADCFE
Init3 = 0x10325476
)
// Digest represents the partial evaluation of a checksum.
struct Digest {
mut:
s []u32
x []byte
nx int
len u64
}
fn (d mut Digest) reset() {
d.s = [u32(0); 4]
d.x = [byte(0); BlockSize]
d.s[0] = u32(Init0)
d.s[1] = u32(Init1)
d.s[2] = u32(Init2)
d.s[3] = u32(Init3)
d.nx = 0
d.len = u64(0)
}
// new returns a new Digest (implementing hash.Hash) computing the MD5 checksum.
2019-09-02 20:22:19 +03:00
pub fn new() &Digest {
2019-07-16 15:20:51 +03:00
mut d := &Digest{}
d.reset()
return d
}
2019-08-07 14:37:07 +03:00
pub fn (d mut Digest) write(p_ []byte) ?int {
mut p := p_
2019-07-16 15:20:51 +03:00
nn := p.len
d.len += u64(nn)
if d.nx > 0 {
2019-07-29 17:33:35 +03:00
n := copy(d.x.right(d.nx), p)
2019-07-16 15:20:51 +03:00
d.nx += n
if d.nx == BlockSize {
2019-08-07 14:37:07 +03:00
block(mut d, d.x)
2019-07-16 15:20:51 +03:00
d.nx = 0
}
if n >= p.len {
p = []byte
} else {
p = p.right(n)
}
}
if p.len >= BlockSize {
n := p.len &~ (BlockSize - 1)
2019-08-07 14:37:07 +03:00
block(mut d, p.left(n))
2019-07-16 15:20:51 +03:00
if n >= p.len {
p = []byte
} else {
p = p.right(n)
}
}
if p.len > 0 {
2019-07-29 17:33:35 +03:00
d.nx = copy(d.x, p)
2019-07-16 15:20:51 +03:00
}
return nn
}
pub fn (d &Digest) sum(b_in mut []byte) []byte {
// Make a copy of d so that caller can keep writing and summing.
mut d0 := *d
hash := d0.checksum()
for b in hash {
b_in << b
}
return *b_in
}
pub fn (d mut Digest) checksum() []byte {
// Append 0x80 to the end of the message and then append zeros
// until the length is a multiple of 56 bytes. Finally append
// 8 bytes representing the message length in bits.
//
// 1 byte end marker :: 0-63 padding bytes :: 8 byte length
// tmp := [1 + 63 + 8]byte{0x80}
mut tmp := [byte(0); 1 + 63 + 8]
tmp[0] = 0x80
pad := (55 - int(d.len)) % 64 // calculate number of padding bytes
binary.little_endian_put_u64(mut tmp.right(1+pad), u64(d.len<<u64(3))) // append length in bits
2019-08-07 14:37:07 +03:00
d.write(tmp.left(1+pad+8))
2019-07-16 15:20:51 +03:00
// The previous write ensures that a whole number of
// blocks (i.e. a multiple of 64 bytes) have been hashed.
if d.nx != 0 {
panic('d.nx != 0')
}
digest := [byte(0); Size]
binary.little_endian_put_u32(mut digest, d.s[0])
binary.little_endian_put_u32(mut digest.right(4), d.s[1])
binary.little_endian_put_u32(mut digest.right(8), d.s[2])
binary.little_endian_put_u32(mut digest.right(12), d.s[3])
2019-07-16 15:20:51 +03:00
return digest
}
2019-07-17 12:00:15 +03:00
// sum returns the MD5 checksum of the data.
2019-07-16 15:20:51 +03:00
pub fn sum(data []byte) []byte {
mut d := new()
2019-08-07 14:37:07 +03:00
d.write(data)
2019-07-16 15:20:51 +03:00
return d.checksum()
}
2019-08-07 10:53:33 +03:00
fn block(dig mut Digest, p []byte) {
2019-07-17 12:00:15 +03:00
// For now just use block_generic until we have specific
// architecture optimized versions
2019-08-07 10:53:33 +03:00
block_generic(mut dig, p)
2019-07-17 12:00:15 +03:00
}
2019-07-16 15:20:51 +03:00
pub fn (d &Digest) size() int { return Size }
2019-07-16 18:59:07 +03:00
pub fn (d &Digest) block_size() int { return BlockSize }
2019-09-02 20:22:19 +03:00
pub fn hexhash(s string) string { return sum(s.bytes()).hex() }