blob: 11e95cf89de55ba0eed7722cbc7b4bc16a2eb2b5 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
/*
* Copyright 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file is distributed
* on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
* express or implied. See the License for the specific language governing
* permissions and limitations under the License.
* The license is detailed in the file LICENSE.md, and applies to this file.
*
* Written by Nir Drucker and Shay Gueron
* AWS Cryptographic Algorithms Group.
* (ndrucker@amazon.com, gueron@amazon.com)
*/
#pragma once
#include "sha.h"
// The parallel_hash algorithm uses the technique described in
// 1) S. Gueron, V. Krasnov. Simultaneous Hashing of Multiple Messages.
// Journal of Information Security 3:319-325 (2012).
// 2) S. Gueron. A j-Lanes Tree Hashing Mode and j-Lanes SHA-256.
// Journal of Information Security 4:7-11 (2013).
// See also:
// 3) S. Gueron. Parallelized Hashing via j-Lanes and j-Pointers Tree Modes,
// with Applications to SHA-256.
// Journal of Information Security 5:91-113 (2014).
//
// It is designed to convert the serial hashing to a parallelizeable process.
//
// This function assumes that m is of N_BITS length and that
// ((la / MAX_MB_SLICES) >= SLICE_REM)
void
parallel_hash(OUT sha_hash_t *out_hash,
IN const uint8_t *m,
IN const uint32_t la);
|
