Find
C
ase-sensitive
R
egexp search
Path
comm-central
/
third_party
/
rnp
/
src
/
lib
/
crypto
/
sha1cd
Navigation
Enable keyboard shortcuts
Name
Description
Size
sha1.c
make sure macros like _BIG_ENDIAN visible
83829
sha1.h
sha-1 compression function that takes an already expanded message, and additionally store intermediate states
4463
ubc_check.c
// this file was generated by the 'parse_bitrel' program in the tools section // using the data files from directory 'tools/data/3565' // // sha1_dvs contains a list of SHA-1 Disturbance Vectors (DV) to check // dvType, dvK and dvB define the DV: I(K,B) or II(K,B) (see the paper) // dm[80] is the expanded message block XOR-difference defined by the DV // testt is the step to do the recompression from for collision detection // maski and maskb define the bit to check for each DV in the dvmask returned by ubc_check // // ubc_check takes as input an expanded message block and verifies the unavoidable bitconditions for all listed DVs // it returns a dvmask where each bit belonging to a DV is set if all unavoidable bitconditions for that DV have been met // thus one needs to do the recompression check for each DV that has its bit set // // ubc_check is programmatically generated and the unavoidable bitconditions have been hardcoded // a directly verifiable version named ubc_check_verify can be found in ubc_check_verify.c // ubc_check has been verified against ubc_check_verify using the 'ubc_check_test' program in the tools section
66299
ubc_check.h
// this file was generated by the 'parse_bitrel' program in the tools section // using the data files from directory 'tools/data/3565' // // sha1_dvs contains a list of SHA-1 Disturbance Vectors (DV) to check // dvType, dvK and dvB define the DV: I(K,B) or II(K,B) (see the paper) // dm[80] is the expanded message block XOR-difference defined by the DV // testt is the step to do the recompression from for collision detection // maski and maskb define the bit to check for each DV in the dvmask returned by ubc_check // // ubc_check takes as input an expanded message block and verifies the unavoidable bitconditions for all listed DVs // it returns a dvmask where each bit belonging to a DV is set if all unavoidable bitconditions for that DV have been met // thus one needs to do the recompression check for each DV that has its bit set
1794