v/vlib/crypto/sha1/sha1.v

152 lines
3.0 KiB
V
Raw Normal View History

2020-02-03 05:00:36 +01:00
// Copyright (c) 2019-2020 Alexander Medvednikov. All rights reserved.
2019-07-15 17:49:01 +02:00
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.
// Package sha1 implements the SHA-1 hash algorithm as defined in RFC 3174.
2019-07-16 14:20:51 +02:00
2019-07-15 17:49:01 +02:00
// SHA-1 is cryptographically broken and should not be used for secure
// applications.
2019-07-16 14:20:51 +02:00
// Based off: https://github.com/golang/go/blob/master/src/crypto/sha1
2019-11-14 07:53:05 +01:00
// Last commit: https://github.com/golang/go/commit/3ce865d7a0b88714cc433454ae2370a105210c01
2019-07-16 14:20:51 +02:00
2019-07-15 17:49:01 +02:00
module sha1
import encoding.binary
pub const(
2019-07-15 17:49:01 +02:00
// The size of a SHA-1 checksum in bytes.
2019-10-24 13:48:20 +02:00
size = 20
2019-07-15 17:49:01 +02:00
// The blocksize of SHA-1 in bytes.
2019-10-24 13:48:20 +02:00
block_size = 64
2019-07-15 17:49:01 +02:00
)
const (
2019-10-24 13:48:20 +02:00
chunk = 64
init0 = 0x67452301
init1 = 0xEFCDAB89
init2 = 0x98BADCFE
init3 = 0x10325476
init4 = 0xC3D2E1F0
2019-07-15 17:49:01 +02:00
)
// digest represents the partial evaluation of a checksum.
struct Digest {
mut:
h []u32
x []byte
nx int
len u64
}
fn (d mut Digest) reset() {
2019-10-24 13:48:20 +02:00
d.x = [byte(0)].repeat(chunk)
d.h = [u32(0)].repeat(5)
2019-10-24 13:48:20 +02:00
d.h[0] = u32(init0)
d.h[1] = u32(init1)
d.h[2] = u32(init2)
d.h[3] = u32(init3)
d.h[4] = u32(init4)
2019-07-15 17:49:01 +02:00
d.nx = 0
d.len = 0
2019-07-15 17:49:01 +02:00
}
2019-07-17 11:00:15 +02:00
// new returns a new Digest (implementing hash.Hash) computing the SHA1 checksum.
2019-07-15 17:49:01 +02:00
pub fn new() &Digest {
mut d := &Digest{}
d.reset()
return d
}
2019-11-04 00:38:49 +01:00
pub fn (d mut Digest) write(p_ []byte) int {
2019-08-07 13:37:07 +02:00
mut p := p_
2019-07-15 17:49:01 +02:00
nn := p.len
d.len += u64(nn)
if d.nx > 0 {
n := copy(d.x[d.nx..], p)
2019-07-15 17:49:01 +02:00
d.nx += n
2019-10-24 13:48:20 +02:00
if d.nx == chunk {
2019-07-17 11:00:15 +02:00
block(d, d.x)
2019-07-15 17:49:01 +02:00
d.nx = 0
}
if n >= p.len {
2019-11-14 07:53:05 +01:00
p = []
2019-07-15 17:49:01 +02:00
} else {
p = p[n..]
2019-07-15 17:49:01 +02:00
}
}
2019-10-24 13:48:20 +02:00
if p.len >= chunk {
n := p.len &~ (chunk - 1)
block(d, p[..n])
2019-07-15 17:49:01 +02:00
if n >= p.len {
2019-11-14 07:53:05 +01:00
p = []
2019-07-15 17:49:01 +02:00
} else {
p = p[n..]
2019-07-15 17:49:01 +02:00
}
}
if p.len > 0 {
2019-07-29 16:33:35 +02:00
d.nx = copy(d.x, p)
2019-07-15 17:49:01 +02:00
}
return nn
}
2019-09-29 15:44:52 +02:00
pub fn (d &Digest) sum(b_in []byte) []byte {
2019-07-15 17:49:01 +02:00
// Make a copy of d so that caller can keep writing and summing.
mut d0 := *d
2019-07-16 14:20:51 +02:00
hash := d0.checksum()
2019-09-29 15:44:52 +02:00
mut b_out := b_in.clone()
2019-07-15 17:49:01 +02:00
for b in hash {
2019-09-29 15:44:52 +02:00
b_out << b
2019-07-15 17:49:01 +02:00
}
2019-09-29 15:44:52 +02:00
return b_out
2019-07-15 17:49:01 +02:00
}
2019-07-16 14:20:51 +02:00
fn (d mut Digest) checksum() []byte {
2019-07-15 17:49:01 +02:00
mut len := d.len
// Padding. Add a 1 bit and 0 bits until 56 bytes mod 64.
mut tmp := [byte(0)].repeat(64)
2019-07-15 17:49:01 +02:00
tmp[0] = 0x80
if int(len)%64 < 56 {
d.write(tmp[..56-int(len)%64])
2019-07-15 17:49:01 +02:00
} else {
d.write(tmp[..64+56-int(len)%64])
2019-07-15 17:49:01 +02:00
}
// Length in bits.
len <<= 3
2019-08-07 09:53:33 +02:00
binary.big_endian_put_u64(mut tmp, len)
d.write(tmp[..8])
2019-07-15 17:49:01 +02:00
2019-10-24 13:48:20 +02:00
mut digest := [byte(0)].repeat(size)
2019-07-15 17:49:01 +02:00
2019-08-07 09:53:33 +02:00
binary.big_endian_put_u32(mut digest, d.h[0])
binary.big_endian_put_u32(mut digest[4..], d.h[1])
binary.big_endian_put_u32(mut digest[8..], d.h[2])
binary.big_endian_put_u32(mut digest[12..], d.h[3])
binary.big_endian_put_u32(mut digest[16..], d.h[4])
2019-07-15 17:49:01 +02:00
return digest
}
// Sum returns the SHA-1 checksum of the data.
pub fn sum(data []byte) []byte {
2019-07-16 14:20:51 +02:00
mut d := new()
2019-08-07 13:37:07 +02:00
d.write(data)
2019-07-16 14:20:51 +02:00
return d.checksum()
2019-07-15 17:49:01 +02:00
}
2019-07-17 11:00:15 +02:00
fn block(dig &Digest, p []byte) {
// For now just use block_generic until we have specific
2019-07-17 11:00:15 +02:00
// architecture optimized versions
2019-08-07 13:37:07 +02:00
block_generic(mut dig, p)
2019-07-17 11:00:15 +02:00
}
2019-10-24 13:48:20 +02:00
pub fn (d &Digest) size() int { return size }
2019-07-15 17:49:01 +02:00
2019-10-24 13:48:20 +02:00
pub fn (d &Digest) block_size() int { return block_size }
2019-09-02 19:22:19 +02:00
pub fn hexhash(s string) string { return sum(s.bytes()).hex() }