2018-01-22 19:51:16 +11:00
|
|
|
/*
|
2018-08-04 15:18:16 +10:00
|
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
2018-01-22 19:51:16 +11:00
|
|
|
*
|
2019-02-09 15:45:18 +11:00
|
|
|
* Copyright 2018-2019 Danny Robson <danny@nerdcruft.net>
|
2018-01-22 19:51:16 +11:00
|
|
|
*/
|
|
|
|
|
2019-02-09 15:45:18 +11:00
|
|
|
#pragma once
|
2018-01-22 19:51:16 +11:00
|
|
|
|
2019-02-09 15:45:18 +11:00
|
|
|
#include <cruft/util/std.hpp>
|
2018-01-22 19:51:16 +11:00
|
|
|
#include <cruft/util/view.hpp>
|
|
|
|
|
|
|
|
#include <array>
|
|
|
|
|
|
|
|
#include <cstdint>
|
|
|
|
#include <cstdlib>
|
|
|
|
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
namespace cruft::crypto::hash {
|
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////
|
|
|
|
template <int>
|
|
|
|
struct traits {};
|
|
|
|
|
|
|
|
|
|
|
|
//-------------------------------------------------------------------------
|
|
|
|
template <>
|
|
|
|
struct traits<256>
|
|
|
|
{
|
2019-02-09 15:45:18 +11:00
|
|
|
using word_t = u32;
|
2018-01-22 19:51:16 +11:00
|
|
|
|
|
|
|
static const std::array<word_t,8> iv;
|
|
|
|
static const std::array<word_t,16> pi;
|
|
|
|
static const std::array<int,4> rotations;
|
|
|
|
static constexpr int rounds = 14;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2018-01-23 17:24:45 +11:00
|
|
|
//-------------------------------------------------------------------------
|
|
|
|
template <>
|
|
|
|
struct traits<224>
|
|
|
|
{
|
|
|
|
using word_t = traits<256>::word_t;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2018-01-22 19:51:16 +11:00
|
|
|
//-------------------------------------------------------------------------
|
|
|
|
template <>
|
|
|
|
struct traits<512>
|
|
|
|
{
|
2019-02-09 15:45:18 +11:00
|
|
|
using word_t = u64;
|
2018-01-22 19:51:16 +11:00
|
|
|
|
|
|
|
static const std::array<word_t,8> iv;
|
|
|
|
static const std::array<word_t,16> pi;
|
|
|
|
static const std::array<int,4> rotations;
|
|
|
|
static constexpr int rounds = 16;
|
|
|
|
};
|
|
|
|
|
2018-01-23 17:24:45 +11:00
|
|
|
|
|
|
|
//-------------------------------------------------------------------------
|
|
|
|
template <>
|
|
|
|
struct traits<384>
|
|
|
|
{
|
|
|
|
using word_t = traits<512>::word_t;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/// an implementation of the BLAKE hash function
|
|
|
|
///
|
|
|
|
/// note that this is _not_ BLAKE2, but the original SHA-3 candidate
|
|
|
|
/// function.
|
|
|
|
///
|
|
|
|
/// \tparam width the number of bits for the digest
|
2018-01-22 19:51:16 +11:00
|
|
|
template <int width>
|
|
|
|
class blake {
|
|
|
|
public:
|
|
|
|
using word_t = typename traits<width>::word_t;
|
2018-01-23 17:24:45 +11:00
|
|
|
|
|
|
|
// size of each round's data block in bytes
|
|
|
|
static const size_t block_size = 16 * sizeof (word_t);
|
|
|
|
|
|
|
|
// size of the digest in bytes
|
|
|
|
static const size_t digest_size = width / 8;
|
2019-02-09 15:45:18 +11:00
|
|
|
using digest_t = std::array<u08,digest_size>;
|
2018-01-23 17:24:45 +11:00
|
|
|
|
|
|
|
|
|
|
|
digest_t operator() (
|
2019-02-09 15:45:18 +11:00
|
|
|
cruft::view<const u08*> data,
|
|
|
|
cruft::view<const u08*> salt
|
2018-01-23 17:24:45 +11:00
|
|
|
) const;
|
2018-01-22 19:51:16 +11:00
|
|
|
|
2019-02-09 15:45:18 +11:00
|
|
|
digest_t operator() (cruft::view<const u08*> data,
|
2018-01-22 19:51:16 +11:00
|
|
|
const std::array<word_t,4> salt) const noexcept;
|
|
|
|
|
2019-02-09 15:45:18 +11:00
|
|
|
digest_t operator() (cruft::view<const u08*> data) const noexcept
|
2018-01-22 19:51:16 +11:00
|
|
|
{
|
|
|
|
return (*this) (data, {0,0,0,0});
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|