Tiger cryptographic hash function for Go
- Tiger cryptographic hash function is designed by Ross Anderson and Eli Biham in 1995.
- The size of a Tiger hash value is 192 bits. Truncated versions (Tiger/128, Tiger/160) are simply prefixes of Tiger/192.
- Tiger2 is a variant where the message is padded by first appending a byte 0x80, rather than 0x01 as in the case of Tiger.
- Links: paper, wikipedia
Implementing hash.Hash. Usage is pretty much the same as other stanard hashing libraries.
Documentation currently available at Godoc: http://godoc.org/github.com/cxmcc/tiger
go get github.com/cxmcc/tiger
package main
import (
"fmt"
"io"
"github.com/cxmcc/tiger"
)
func main() {
h := tiger.New()
io.WriteString(h, "Example for tiger")
fmt.Printf("Output: %x\n", h.Sum(nil))
// Output: 82bd060e19f945014f0063e8f0e6d7decfa9edfd97e76743
}
It's MIT License