Tillich-Zémor hashing golang implementation
3de3046074
1. Perform masking with 2 instructions instead of 3 (use arithmetic shift). 2. Broadcast data byte in one instruction at the start of byte-processing 3. Reorder instructions to reduce the amount of data hazards and resources contention. ``` name old time/op new time/op delta Sum/AVX2_digest-8 1.39ms ± 0% 1.22ms ± 0% -12.18% (p=0.000 n=9+7) name old speed new speed delta Sum/AVX2_digest-8 71.7MB/s ± 0% 81.7MB/s ± 0% +13.87% (p=0.000 n=9+7) ``` Signed-off-by: Evgenii Stratonikov <evgeniy@nspcc.ru> |
||
|---|---|---|
| .github/workflows | ||
| cmd | ||
| gf127 | ||
| tz | ||
| .gitignore | ||
| auto.sh | ||
| benchmark | ||
| Dockerfile | ||
| go.mod | ||
| go.sum | ||
| LICENSE | ||
| Makefile | ||
| README.md | ||
Demo
In project root:
# show help
make
# run auto demo
make auto
Homomorphic hashing in golang
Package tz containts pure-Go implementation of hashing function described by Tillich and Źemor in [1] .
There are existing implementations already (e.g. [2]), however they are written in C.
Package gf127 contains arithmetic in GF(2^127) with x^127+x^63+1 as reduction polynomial.
Description
It can be used instead of Merkle-tree for data-validation, because homomorphic hashes are concatenable: hash sum of data can be calculated based on hashes of chunks.
The example of how it works can be seen in tests.
Benchmarks
go vs AVX vs AVX2 version
BenchmarkSum/AVX_digest-8 308 3889484 ns/op 25.71 MB/s 5 allocs/op
BenchmarkSum/AVXInline_digest-8 457 2455437 ns/op 40.73 MB/s 5 allocs/op
BenchmarkSum/AVX2_digest-8 399 3031102 ns/op 32.99 MB/s 3 allocs/op
BenchmarkSum/AVX2Inline_digest-8 602 2077719 ns/op 48.13 MB/s 3 allocs/op
BenchmarkSum/PureGo_digest-8 68 17795480 ns/op 5.62 MB/s 5 allocs/op
Contributing
At this moment, we do not accept contributions. Follow us.
Makefile
→ make
Usage:
make <target>
Targets:
attach Attach to existing container
auto Auto Tillich-Zémor hasher demo
down Stop demo container
help Show this help prompt
up Run Tillich-Zémor hasher demo
Links
[1] https://link.springer.com/content/pdf/10.1007/3-540-48658-5_5.pdf