2019-07-18 11:50:05 +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 sha256 implements the SHA224 and SHA256 hash algorithms as defined
|
|
|
|
// in FIPS 180-4.
|
|
|
|
|
2019-08-02 07:37:19 +03:00
|
|
|
// Based off: https://github.com/golang/go/tree/master/src/crypto/sha256
|
|
|
|
// Last commit: https://github.com/golang/go/commit/3ce865d7a0b88714cc433454ae2370a105210c01
|
2019-07-18 11:50:05 +03:00
|
|
|
|
|
|
|
module sha256
|
|
|
|
|
|
|
|
import encoding.binary
|
|
|
|
|
|
|
|
const (
|
|
|
|
// The size of a SHA256 checksum in bytes.
|
|
|
|
Size = 32
|
|
|
|
// The size of a SHA224 checksum in bytes.
|
|
|
|
Size224 = 28
|
|
|
|
// The blocksize of SHA256 and SHA224 in bytes.
|
|
|
|
BlockSize = 64
|
|
|
|
)
|
|
|
|
|
|
|
|
const (
|
|
|
|
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
|
|
|
|
}
|
|
|
|
|
2019-08-07 09:19:27 +03:00
|
|
|
fn (d mut Digest) reset() {
|
2019-09-15 12:26:05 +03:00
|
|
|
d.h = [u32(0)].repeat(8)
|
|
|
|
d.x = [byte(0)].repeat(Chunk)
|
2019-07-18 11:50:05 +03:00
|
|
|
if !d.is224 {
|
|
|
|
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 {
|
|
|
|
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 = u64(0)
|
|
|
|
}
|
|
|
|
|
|
|
|
// new returns a new Digest (implementing hash.Hash) computing the SHA256 checksum.
|
2019-09-02 20:22:19 +03:00
|
|
|
pub fn new() &Digest {
|
2019-07-18 11:50:05 +03:00
|
|
|
mut d := &Digest{}
|
|
|
|
d.reset()
|
|
|
|
return d
|
|
|
|
}
|
|
|
|
|
|
|
|
// new224 returns a new Digest (implementing hash.Hash) computing the SHA224 checksum.
|
2019-09-02 20:22:19 +03:00
|
|
|
pub fn new224() &Digest {
|
2019-07-18 11:50:05 +03:00
|
|
|
mut d := &Digest{}
|
|
|
|
d.is224 = true
|
|
|
|
d.reset()
|
|
|
|
return d
|
|
|
|
}
|
|
|
|
|
2019-08-07 14:37:07 +03:00
|
|
|
fn (d mut Digest) write(p_ []byte) ?int {
|
|
|
|
mut p := p_
|
2019-07-18 11:50:05 +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-18 11:50:05 +03:00
|
|
|
d.nx += n
|
|
|
|
if d.nx == Chunk {
|
2019-08-07 10:53:33 +03:00
|
|
|
block(mut d, d.x)
|
2019-07-18 11:50:05 +03:00
|
|
|
d.nx = 0
|
|
|
|
}
|
|
|
|
if n >= p.len {
|
|
|
|
p = []byte
|
|
|
|
} else {
|
|
|
|
p = p.right(n)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if p.len >= Chunk {
|
|
|
|
n := p.len &~ (Chunk - 1)
|
2019-08-07 10:53:33 +03:00
|
|
|
block(mut d, p.left(n))
|
2019-07-18 11:50:05 +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-18 11:50:05 +03:00
|
|
|
}
|
|
|
|
return nn
|
|
|
|
}
|
|
|
|
|
|
|
|
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()
|
|
|
|
if d0.is224 {
|
|
|
|
for b in hash.left(Size224) {
|
|
|
|
b_in << b
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
for b in hash {
|
|
|
|
b_in << b
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return *b_in
|
|
|
|
}
|
|
|
|
|
|
|
|
fn (d mut Digest) checksum() []byte {
|
|
|
|
mut len := d.len
|
|
|
|
// Padding. Add a 1 bit and 0 bits until 56 bytes mod 64.
|
2019-09-15 12:26:05 +03:00
|
|
|
mut tmp := [byte(0)].repeat(64)
|
2019-07-18 11:50:05 +03:00
|
|
|
tmp[0] = 0x80
|
|
|
|
if int(len)%64 < 56 {
|
2019-08-07 14:37:07 +03:00
|
|
|
d.write(tmp.left(56-int(len)%64))
|
2019-07-18 11:50:05 +03:00
|
|
|
} else {
|
2019-08-07 14:37:07 +03:00
|
|
|
d.write(tmp.left(64+56-int(len)%64))
|
2019-07-18 11:50:05 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Length in bits.
|
|
|
|
len <<= u64(3)
|
2019-08-07 09:19:27 +03:00
|
|
|
binary.big_endian_put_u64(mut tmp, len)
|
2019-08-07 14:37:07 +03:00
|
|
|
d.write(tmp.left(8))
|
2019-07-18 11:50:05 +03:00
|
|
|
|
|
|
|
if d.nx != 0 {
|
|
|
|
panic('d.nx != 0')
|
|
|
|
}
|
|
|
|
|
2019-09-15 12:26:05 +03:00
|
|
|
digest := [byte(0)].repeat(Size)
|
2019-07-18 11:50:05 +03:00
|
|
|
|
2019-08-07 09:19:27 +03:00
|
|
|
binary.big_endian_put_u32(mut digest, d.h[0])
|
|
|
|
binary.big_endian_put_u32(mut digest.right(4), d.h[1])
|
|
|
|
binary.big_endian_put_u32(mut digest.right(8), d.h[2])
|
|
|
|
binary.big_endian_put_u32(mut digest.right(12), d.h[3])
|
|
|
|
binary.big_endian_put_u32(mut digest.right(16), d.h[4])
|
|
|
|
binary.big_endian_put_u32(mut digest.right(20), d.h[5])
|
|
|
|
binary.big_endian_put_u32(mut digest.right(24), d.h[6])
|
2019-07-18 11:50:05 +03:00
|
|
|
if !d.is224 {
|
2019-08-07 10:53:33 +03:00
|
|
|
binary.big_endian_put_u32(mut digest.right(28), d.h[7])
|
2019-07-18 11:50:05 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
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 14:37:07 +03:00
|
|
|
d.write(data)
|
2019-07-18 11:50:05 +03:00
|
|
|
return d.checksum()
|
|
|
|
}
|
|
|
|
|
|
|
|
// sum224 returns the SHA224 checksum of the data.
|
|
|
|
pub fn sum224(data []byte) []byte {
|
|
|
|
mut d := new224()
|
2019-08-07 14:37:07 +03:00
|
|
|
d.write(data)
|
2019-07-18 11:50:05 +03:00
|
|
|
sum := d.checksum()
|
2019-09-15 12:26:05 +03:00
|
|
|
mut sum224 := [byte(0)].repeat(Size224)
|
2019-07-29 17:33:35 +03:00
|
|
|
copy(sum224, sum.left(Size224))
|
2019-07-18 11:50:05 +03:00
|
|
|
return sum224
|
|
|
|
}
|
|
|
|
|
2019-08-07 10:53:33 +03:00
|
|
|
fn block(dig mut Digest, p []byte) {
|
2019-07-18 11:50:05 +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-18 11:50:05 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
pub fn (d &Digest) size() int {
|
|
|
|
if !d.is224 {
|
|
|
|
return Size
|
|
|
|
}
|
|
|
|
return Size224
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn (d &Digest) block_size() int { return BlockSize }
|
2019-09-02 20:22:19 +03:00
|
|
|
|
|
|
|
pub fn hexhash(s string) string { return sum256(s.bytes()).hex() }
|
|
|
|
pub fn hexhash_224(s string) string { return sum224(s.bytes()).hex() }
|