v/vlib/crypto/sha256/sha256.v

219 lines
4.8 KiB
V
Raw Normal View History

// 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 sha256 implements the SHA224 and SHA256 hash algorithms as defined
// in FIPS 180-4.
// Based off: https://github.com/golang/go/tree/master/src/crypto/sha256
// Last commit: https://github.com/golang/go/commit/3ce865d7a0b88714cc433454ae2370a105210c01
module sha256
import encoding.binary
const (
// The size of a SHA256 checksum in bytes.
2019-10-24 13:48:20 +02:00
size = 32
// The size of a SHA224 checksum in bytes.
2019-10-24 13:48:20 +02:00
size224 = 28
// The blocksize of SHA256 and SHA224 in bytes.
2019-10-24 13:48:20 +02:00
block_size = 64
)
const (
2019-10-24 13:48:20 +02:00
chunk = 64
init0 = 0x6A09E667
init1 = 0xBB67AE85
init2 = 0x3C6EF372
init3 = 0xA54FF53A
init4 = 0x510E527F
init5 = 0x9B05688C
init6 = 0x1F83D9AB
init7 = 0x5BE0CD19
init0_224 = 0xC1059ED8
init1_224 = 0x367CD507
init2_224 = 0x3070DD17
init3_224 = 0xF70E5939
init4_224 = 0xFFC00B31
init5_224 = 0x68581511
init6_224 = 0x64F98FA7
init7_224 = 0xBEFA4FA4
)
// digest represents the partial evaluation of a checksum.
struct Digest {
mut:
h []u32
x []byte
nx int
len u64
is224 bool // mark if this digest is SHA-224
}
fn (d mut Digest) reset() {
d.h = [u32(0)].repeat(8)
2019-10-24 13:48:20 +02:00
d.x = [byte(0)].repeat(chunk)
if !d.is224 {
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)
d.h[5] = u32(init5)
d.h[6] = u32(init6)
d.h[7] = u32(init7)
} else {
2019-10-24 13:48:20 +02:00
d.h[0] = u32(init0_224)
d.h[1] = u32(init1_224)
d.h[2] = u32(init2_224)
d.h[3] = u32(init3_224)
d.h[4] = u32(init4_224)
d.h[5] = u32(init5_224)
d.h[6] = u32(init6_224)
d.h[7] = u32(init7_224)
}
d.nx = 0
d.len = 0
}
// new returns a new Digest (implementing hash.Hash) computing the SHA256 checksum.
2019-09-02 19:22:19 +02:00
pub fn new() &Digest {
mut d := &Digest{}
d.reset()
return d
}
// new224 returns a new Digest (implementing hash.Hash) computing the SHA224 checksum.
2019-09-02 19:22:19 +02:00
pub fn new224() &Digest {
mut d := &Digest{}
d.is224 = true
d.reset()
return d
}
2019-11-04 00:38:49 +01:00
fn (d mut Digest) write(p_ []byte) int {
2019-08-07 13:37:07 +02:00
mut p := p_
nn := p.len
d.len += u64(nn)
if d.nx > 0 {
n := copy(d.x[d.nx..], p)
d.nx += n
2019-10-24 13:48:20 +02:00
if d.nx == chunk {
2019-08-07 09:53:33 +02:00
block(mut d, d.x)
d.nx = 0
}
if n >= p.len {
p = []byte
} else {
p = p[n..]
}
}
2019-10-24 13:48:20 +02:00
if p.len >= chunk {
n := p.len &~ (chunk - 1)
block(mut d, p[..n])
if n >= p.len {
p = []byte
} else {
p = p[n..]
}
}
if p.len > 0 {
2019-07-29 16:33:35 +02:00
d.nx = copy(d.x, p)
}
return nn
}
2019-09-29 15:44:52 +02:00
fn (d &Digest) sum(b_in []byte) []byte {
// Make a copy of d so that caller can keep writing and summing.
mut d0 := *d
hash := d0.checksum()
2019-09-29 15:44:52 +02:00
mut b_out := b_in.clone()
if d0.is224 {
for b in hash[..size224] {
2019-09-29 15:44:52 +02:00
b_out << b
}
} else {
for b in hash {
2019-09-29 15:44:52 +02:00
b_out << b
}
}
2019-09-29 15:44:52 +02:00
return b_out
}
fn (d mut Digest) checksum() []byte {
mut len := d.len
// Padding. Add a 1 bit and 0 bits until 56 bytes mod 64.
mut tmp := [byte(0)].repeat(64)
tmp[0] = 0x80
if int(len)%64 < 56 {
d.write(tmp[..56-int(len)%64])
} else {
d.write(tmp[..64+56-int(len)%64])
}
// Length in bits.
len <<= u64(3)
binary.big_endian_put_u64(mut tmp, len)
d.write(tmp[..8])
if d.nx != 0 {
panic('d.nx != 0')
}
2019-10-24 13:48:20 +02:00
digest := [byte(0)].repeat(size)
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])
binary.big_endian_put_u32(mut digest[20..], d.h[5])
binary.big_endian_put_u32(mut digest[24..], d.h[6])
if !d.is224 {
binary.big_endian_put_u32(mut digest[28..], d.h[7])
}
return digest
}
// sum256 returns the SHA256 checksum of the data.
pub fn sum(data []byte) []byte {
return sum256(data)
}
// sum256 returns the SHA256 checksum of the data.
pub fn sum256(data []byte) []byte {
mut d := new()
2019-08-07 13:37:07 +02:00
d.write(data)
return d.checksum()
}
// sum224 returns the SHA224 checksum of the data.
pub fn sum224(data []byte) []byte {
mut d := new224()
2019-08-07 13:37:07 +02:00
d.write(data)
sum := d.checksum()
2019-10-24 13:48:20 +02:00
mut sum224 := [byte(0)].repeat(size224)
copy(sum224, sum[..size224])
return sum224
}
2019-08-07 09:53:33 +02:00
fn block(dig mut Digest, p []byte) {
// For now just use block_generic until we have specific
// architecture optimized versions
2019-08-07 09:53:33 +02:00
block_generic(mut dig, p)
}
pub fn (d &Digest) size() int {
if !d.is224 {
2019-10-24 13:48:20 +02:00
return size
}
2019-10-24 13:48:20 +02:00
return size224
}
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 sum256(s.bytes()).hex() }
pub fn hexhash_224(s string) string { return sum224(s.bytes()).hex() }