2 * Copyright 2017 Marc Stevens <marc@marc-stevens.nl>, Dan Shumow <danshu@microsoft.com>
3 * Distributed under the MIT Software License.
4 * See accompanying file LICENSE.txt or copy at
5 * https://opensource.org/licenses/MIT
9 // this file was generated by the 'parse_bitrel' program in the tools section
10 // using the data files from directory 'tools/data/3565'
12 // sha1_dvs contains a list of SHA-1 Disturbance Vectors (DV) to check
13 // dvType, dvK and dvB define the DV: I(K,B) or II(K,B) (see the paper)
14 // dm[80] is the expanded message block XOR-difference defined by the DV
15 // testt is the step to do the recompression from for collision detection
16 // maski and maskb define the bit to check for each DV in the dvmask returned by ubc_check
18 // ubc_check takes as input an expanded message block and verifies the unavoidable bitconditions for all listed DVs
19 // it returns a dvmask where each bit belonging to a DV is set if all unavoidable bitconditions for that DV have been met
20 // thus one needs to do the recompression check for each DV that has its bit set
26 #if defined(__cplusplus)
31 typedef struct { int dvType
; int dvK
; int dvB
; int testt
; int maski
; int maskb
; uint32_t dm
[80]; } dv_info_t
;
32 extern dv_info_t sha1_dvs
[];
33 void ubc_check(const uint32_t W
[80], uint32_t dvmask
[DVMASKSIZE
]);
35 #define DOSTORESTATE58
36 #define DOSTORESTATE65
38 #define CHECK_DVMASK(_DVMASK) (0 != _DVMASK[0])
40 #if defined(__cplusplus)
44 #endif /* UBC_CHECK_H */