mirror of
https://github.com/XTLS/REALITY.git
synced 2025-08-22 14:38:35 +00:00
The new implementation encodes the key schedule into the type system, which is actually nicer than what we had before. For #69536 Change-Id: Iddab62c2aae40bc2425a155443576bb9b7aafe03 Reviewed-on: https://go-review.googlesource.com/c/go/+/626836 Reviewed-by: Russ Cox <rsc@golang.org> Reviewed-by: Roland Shoemaker <roland@golang.org> Commit-Queue: Roland Shoemaker <roland@golang.org> LUCI-TryBot-Result: Go LUCI <golang-scoped@luci-project-accounts.iam.gserviceaccount.com> Auto-Submit: Filippo Valsorda <filippo@golang.org> Reviewed-by: Daniel McCarney <daniel@binaryparadox.net>
231 lines
5.0 KiB
Go
231 lines
5.0 KiB
Go
// Copyright 2009 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
// Package sha256 implements the SHA-224 and SHA-256 hash algorithms as defined
|
|
// in FIPS 180-4.
|
|
package sha256
|
|
|
|
import (
|
|
//"github.com/xtls/reality"
|
|
"github.com/xtls/reality/byteorder"
|
|
"errors"
|
|
)
|
|
|
|
// The size of a SHA-256 checksum in bytes.
|
|
const size = 32
|
|
|
|
// The size of a SHA-224 checksum in bytes.
|
|
const size224 = 28
|
|
|
|
// The block size of SHA-256 and SHA-224 in bytes.
|
|
const 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 is a SHA-224 or SHA-256 [hash.Hash] implementation.
|
|
type Digest struct {
|
|
h [8]uint32
|
|
x [chunk]byte
|
|
nx int
|
|
len uint64
|
|
is224 bool // mark if this digest is SHA-224
|
|
}
|
|
|
|
const (
|
|
magic224 = "sha\x02"
|
|
magic256 = "sha\x03"
|
|
marshaledSize = len(magic256) + 8*4 + chunk + 8
|
|
)
|
|
|
|
func (d *Digest) MarshalBinary() ([]byte, error) {
|
|
return d.AppendBinary(make([]byte, 0, marshaledSize))
|
|
}
|
|
|
|
func (d *Digest) AppendBinary(b []byte) ([]byte, error) {
|
|
if d.is224 {
|
|
b = append(b, magic224...)
|
|
} else {
|
|
b = append(b, magic256...)
|
|
}
|
|
b = byteorder.BEAppendUint32(b, d.h[0])
|
|
b = byteorder.BEAppendUint32(b, d.h[1])
|
|
b = byteorder.BEAppendUint32(b, d.h[2])
|
|
b = byteorder.BEAppendUint32(b, d.h[3])
|
|
b = byteorder.BEAppendUint32(b, d.h[4])
|
|
b = byteorder.BEAppendUint32(b, d.h[5])
|
|
b = byteorder.BEAppendUint32(b, d.h[6])
|
|
b = byteorder.BEAppendUint32(b, d.h[7])
|
|
b = append(b, d.x[:d.nx]...)
|
|
b = append(b, make([]byte, len(d.x)-d.nx)...)
|
|
b = byteorder.BEAppendUint64(b, d.len)
|
|
return b, nil
|
|
}
|
|
|
|
func (d *Digest) UnmarshalBinary(b []byte) error {
|
|
if len(b) < len(magic224) || (d.is224 && string(b[:len(magic224)]) != magic224) || (!d.is224 && string(b[:len(magic256)]) != magic256) {
|
|
return errors.New("crypto/sha256: invalid hash state identifier")
|
|
}
|
|
if len(b) != marshaledSize {
|
|
return errors.New("crypto/sha256: invalid hash state size")
|
|
}
|
|
b = b[len(magic224):]
|
|
b, d.h[0] = consumeUint32(b)
|
|
b, d.h[1] = consumeUint32(b)
|
|
b, d.h[2] = consumeUint32(b)
|
|
b, d.h[3] = consumeUint32(b)
|
|
b, d.h[4] = consumeUint32(b)
|
|
b, d.h[5] = consumeUint32(b)
|
|
b, d.h[6] = consumeUint32(b)
|
|
b, d.h[7] = consumeUint32(b)
|
|
b = b[copy(d.x[:], b):]
|
|
b, d.len = consumeUint64(b)
|
|
d.nx = int(d.len % chunk)
|
|
return nil
|
|
}
|
|
|
|
func consumeUint64(b []byte) ([]byte, uint64) {
|
|
return b[8:], byteorder.BEUint64(b)
|
|
}
|
|
|
|
func consumeUint32(b []byte) ([]byte, uint32) {
|
|
return b[4:], byteorder.BEUint32(b)
|
|
}
|
|
|
|
func (d *Digest) Reset() {
|
|
if !d.is224 {
|
|
d.h[0] = init0
|
|
d.h[1] = init1
|
|
d.h[2] = init2
|
|
d.h[3] = init3
|
|
d.h[4] = init4
|
|
d.h[5] = init5
|
|
d.h[6] = init6
|
|
d.h[7] = init7
|
|
} else {
|
|
d.h[0] = init0_224
|
|
d.h[1] = init1_224
|
|
d.h[2] = init2_224
|
|
d.h[3] = init3_224
|
|
d.h[4] = init4_224
|
|
d.h[5] = init5_224
|
|
d.h[6] = init6_224
|
|
d.h[7] = init7_224
|
|
}
|
|
d.nx = 0
|
|
d.len = 0
|
|
}
|
|
|
|
// New returns a new Digest computing the SHA-256 hash.
|
|
func New() *Digest {
|
|
d := new(Digest)
|
|
d.Reset()
|
|
return d
|
|
}
|
|
|
|
// New224 returns a new Digest computing the SHA-224 hash.
|
|
func New224() *Digest {
|
|
d := new(Digest)
|
|
d.is224 = true
|
|
d.Reset()
|
|
return d
|
|
}
|
|
|
|
func (d *Digest) Size() int {
|
|
if !d.is224 {
|
|
return size
|
|
}
|
|
return size224
|
|
}
|
|
|
|
func (d *Digest) BlockSize() int { return blockSize }
|
|
|
|
func (d *Digest) Write(p []byte) (nn int, err error) {
|
|
nn = len(p)
|
|
d.len += uint64(nn)
|
|
if d.nx > 0 {
|
|
n := copy(d.x[d.nx:], p)
|
|
d.nx += n
|
|
if d.nx == chunk {
|
|
block(d, d.x[:])
|
|
d.nx = 0
|
|
}
|
|
p = p[n:]
|
|
}
|
|
if len(p) >= chunk {
|
|
n := len(p) &^ (chunk - 1)
|
|
block(d, p[:n])
|
|
p = p[n:]
|
|
}
|
|
if len(p) > 0 {
|
|
d.nx = copy(d.x[:], p)
|
|
}
|
|
return
|
|
}
|
|
|
|
func (d *Digest) Sum(in []byte) []byte {
|
|
//fips140.RecordApproved()
|
|
// Make a copy of d so that caller can keep writing and summing.
|
|
d0 := *d
|
|
hash := d0.checkSum()
|
|
if d0.is224 {
|
|
return append(in, hash[:size224]...)
|
|
}
|
|
return append(in, hash[:]...)
|
|
}
|
|
|
|
func (d *Digest) checkSum() [size]byte {
|
|
len := d.len
|
|
// Padding. Add a 1 bit and 0 bits until 56 bytes mod 64.
|
|
var tmp [64 + 8]byte // padding + length buffer
|
|
tmp[0] = 0x80
|
|
var t uint64
|
|
if len%64 < 56 {
|
|
t = 56 - len%64
|
|
} else {
|
|
t = 64 + 56 - len%64
|
|
}
|
|
|
|
// Length in bits.
|
|
len <<= 3
|
|
padlen := tmp[:t+8]
|
|
byteorder.BEPutUint64(padlen[t+0:], len)
|
|
d.Write(padlen)
|
|
|
|
if d.nx != 0 {
|
|
panic("d.nx != 0")
|
|
}
|
|
|
|
var digest [size]byte
|
|
|
|
byteorder.BEPutUint32(digest[0:], d.h[0])
|
|
byteorder.BEPutUint32(digest[4:], d.h[1])
|
|
byteorder.BEPutUint32(digest[8:], d.h[2])
|
|
byteorder.BEPutUint32(digest[12:], d.h[3])
|
|
byteorder.BEPutUint32(digest[16:], d.h[4])
|
|
byteorder.BEPutUint32(digest[20:], d.h[5])
|
|
byteorder.BEPutUint32(digest[24:], d.h[6])
|
|
if !d.is224 {
|
|
byteorder.BEPutUint32(digest[28:], d.h[7])
|
|
}
|
|
|
|
return digest
|
|
} |