This repository has been archived by the owner on Oct 28, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Implement EIP-152: Add Blake2 compression function F precompile (#5751)
Implement EIP-152: Add Blake2 compression function F precompile
- Loading branch information
Showing
7 changed files
with
375 additions
and
2 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,160 @@ | ||
| /// Aleth: Ethereum C++ client, tools and libraries. | ||
| // Copyright 2019 Aleth Authors. | ||
| // Licensed under the GNU General Public License, Version 3. | ||
|
|
||
| #include "Blake2.h" | ||
|
|
||
| #include <libdevcore/Exceptions.h> | ||
|
|
||
| // The Blake 2 F compression function implemenation is based on the reference implementation, | ||
| // see https://github.com/BLAKE2/BLAKE2/blob/master/ref/blake2b-ref.c | ||
| // The changes in original code were done mostly to accommodate variable round number and to remove | ||
| // unnecessary big endian support. | ||
|
|
||
| namespace dev | ||
| { | ||
| namespace crypto | ||
| { | ||
| namespace | ||
| { | ||
| DEV_SIMPLE_EXCEPTION(InvalidInputSize); | ||
|
|
||
| constexpr size_t BLAKE2B_BLOCKBYTES = 128; | ||
|
|
||
| struct blake2b_state | ||
| { | ||
| uint64_t h[8]; | ||
| uint64_t t[2]; | ||
| uint64_t f[2]; | ||
| uint8_t buf[BLAKE2B_BLOCKBYTES]; | ||
| size_t buflen; | ||
| size_t outlen; | ||
| uint8_t last_node; | ||
| }; | ||
|
|
||
| // clang-format off | ||
| constexpr uint64_t blake2b_IV[8] = | ||
| { | ||
| 0x6a09e667f3bcc908ULL, 0xbb67ae8584caa73bULL, | ||
| 0x3c6ef372fe94f82bULL, 0xa54ff53a5f1d36f1ULL, | ||
| 0x510e527fade682d1ULL, 0x9b05688c2b3e6c1fULL, | ||
| 0x1f83d9abfb41bd6bULL, 0x5be0cd19137e2179ULL | ||
| }; | ||
|
|
||
| constexpr uint8_t blake2b_sigma[12][16] = | ||
| { | ||
| { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } , | ||
| { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } , | ||
| { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } , | ||
| { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } , | ||
| { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } , | ||
| { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } , | ||
| { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } , | ||
| { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } , | ||
| { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } , | ||
| { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } , | ||
| }; | ||
| // clang-format on | ||
|
|
||
| inline uint64_t load64(const void* src) noexcept | ||
| { | ||
| uint64_t w; | ||
| memcpy(&w, src, sizeof w); | ||
| return w; | ||
| } | ||
|
|
||
| inline constexpr uint64_t rotr64(uint64_t w, unsigned c) noexcept | ||
| { | ||
| return (w >> c) | (w << (64 - c)); | ||
| } | ||
|
|
||
| inline void G(uint8_t r, uint8_t i, uint64_t& a, uint64_t& b, uint64_t& c, uint64_t& d, | ||
| const uint64_t* m) noexcept | ||
| { | ||
| a = a + b + m[blake2b_sigma[r][2 * i + 0]]; | ||
| d = rotr64(d ^ a, 32); | ||
| c = c + d; | ||
| b = rotr64(b ^ c, 24); | ||
| a = a + b + m[blake2b_sigma[r][2 * i + 1]]; | ||
| d = rotr64(d ^ a, 16); | ||
| c = c + d; | ||
| b = rotr64(b ^ c, 63); | ||
| } | ||
|
|
||
| inline void ROUND(uint32_t round, uint64_t* v, const uint64_t* m) noexcept | ||
| { | ||
| uint8_t const r = round % 10; | ||
| G(r, 0, v[0], v[4], v[8], v[12], m); | ||
| G(r, 1, v[1], v[5], v[9], v[13], m); | ||
| G(r, 2, v[2], v[6], v[10], v[14], m); | ||
| G(r, 3, v[3], v[7], v[11], v[15], m); | ||
| G(r, 4, v[0], v[5], v[10], v[15], m); | ||
| G(r, 5, v[1], v[6], v[11], v[12], m); | ||
| G(r, 6, v[2], v[7], v[8], v[13], m); | ||
| G(r, 7, v[3], v[4], v[9], v[14], m); | ||
| } | ||
|
|
||
|
|
||
| void blake2b_compress( | ||
| uint32_t rounds, blake2b_state* S, const uint8_t block[BLAKE2B_BLOCKBYTES]) noexcept | ||
| { | ||
| uint64_t m[16]; | ||
| uint64_t v[16]; | ||
|
|
||
| for (size_t i = 0; i < 16; ++i) | ||
| m[i] = load64(block + i * sizeof(m[i])); | ||
|
|
||
| for (size_t i = 0; i < 8; ++i) | ||
| v[i] = S->h[i]; | ||
|
|
||
| v[8] = blake2b_IV[0]; | ||
| v[9] = blake2b_IV[1]; | ||
| v[10] = blake2b_IV[2]; | ||
| v[11] = blake2b_IV[3]; | ||
| v[12] = blake2b_IV[4] ^ S->t[0]; | ||
| v[13] = blake2b_IV[5] ^ S->t[1]; | ||
| v[14] = blake2b_IV[6] ^ S->f[0]; | ||
| v[15] = blake2b_IV[7] ^ S->f[1]; | ||
|
|
||
| for (uint32_t r = 0; r < rounds; ++r) | ||
| ROUND(r, v, m); | ||
|
|
||
| for (size_t i = 0; i < 8; ++i) | ||
| S->h[i] = S->h[i] ^ v[i] ^ v[i + 8]; | ||
| } | ||
|
|
||
| } // namespace | ||
|
|
||
|
|
||
| bytes blake2FCompression(uint32_t _rounds, bytesConstRef _stateVector, bytesConstRef _t0, | ||
| bytesConstRef _t1, bool _lastBlock, bytesConstRef _messageBlockVector) | ||
| { | ||
| if (_stateVector.size() != sizeof(blake2b_state::h)) | ||
| BOOST_THROW_EXCEPTION(InvalidInputSize()); | ||
|
|
||
| blake2b_state s{}; | ||
| std::memcpy(&s.h, _stateVector.data(), _stateVector.size()); | ||
|
|
||
| if (_t0.size() != sizeof(s.t[0]) || _t1.size() != sizeof(s.t[1])) | ||
| BOOST_THROW_EXCEPTION(InvalidInputSize()); | ||
|
|
||
| s.t[0] = load64(_t0.data()); | ||
| s.t[1] = load64(_t1.data()); | ||
| s.f[0] = _lastBlock ? std::numeric_limits<uint64_t>::max() : 0; | ||
|
|
||
| if (_messageBlockVector.size() != BLAKE2B_BLOCKBYTES) | ||
| BOOST_THROW_EXCEPTION(InvalidInputSize()); | ||
|
|
||
| uint8_t block[BLAKE2B_BLOCKBYTES]; | ||
| std::copy(_messageBlockVector.begin(), _messageBlockVector.end(), &block[0]); | ||
|
|
||
| blake2b_compress(_rounds, &s, block); | ||
|
|
||
| bytes result(sizeof(s.h)); | ||
| std::memcpy(&result[0], &s.h[0], result.size()); | ||
|
|
||
| return result; | ||
| } | ||
|
|
||
| } // namespace crypto | ||
| } // namespace dev |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,24 @@ | ||
| /// Aleth: Ethereum C++ client, tools and libraries. | ||
| // Copyright 2019 Aleth Authors. | ||
| // Licensed under the GNU General Public License, Version 3. | ||
|
|
||
| #pragma once | ||
|
|
||
| #include <libdevcore/Common.h> | ||
|
|
||
| namespace dev | ||
| { | ||
| namespace crypto | ||
| { | ||
| /// Calculates the compression function F used in the BLAKE2 cryptographic hashing algorithm | ||
| /// Throws exception in case input data has incorrect size. | ||
| /// @param _rounds the number of rounds | ||
| /// @param _stateVector the state vector - 8 unsigned 64-bit little-endian words | ||
| /// @param _t0, _t1 offset counters - unsigned 64-bit little-endian words | ||
| /// @param _lastBlock the final block indicator flag | ||
| /// @param _messageBlock the message block vector - 16 unsigned 64-bit little-endian words | ||
| /// @returns updated state vector with unchanged encoding (little-endian) | ||
| bytes blake2FCompression(uint32_t _rounds, bytesConstRef _stateVector, bytesConstRef _t0, | ||
| bytesConstRef _t1, bool _lastBlock, bytesConstRef _messageBlock); | ||
| } | ||
| } // namespace dev |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.