mirror of
https://codeberg.org/anoncontributorxmr/monero.git
synced 2024-11-23 19:33:28 +01:00
22 lines
828 B
C
22 lines
828 B
C
|
/*This program gives the 64-bit optimized bitslice implementation of JH using ANSI C
|
||
|
|
||
|
--------------------------------
|
||
|
Performance
|
||
|
|
||
|
Microprocessor: Intel CORE 2 processor (Core 2 Duo Mobile T6600 2.2GHz)
|
||
|
Operating System: 64-bit Ubuntu 10.04 (Linux kernel 2.6.32-22-generic)
|
||
|
Speed for long message:
|
||
|
1) 45.8 cycles/byte compiler: Intel C++ Compiler 11.1 compilation option: icc -O2
|
||
|
2) 56.8 cycles/byte compiler: gcc 4.4.3 compilation option: gcc -O3
|
||
|
|
||
|
--------------------------------
|
||
|
Last Modified: January 16, 2011
|
||
|
*/
|
||
|
#pragma once
|
||
|
|
||
|
typedef unsigned char BitSequence;
|
||
|
typedef unsigned long long DataLength;
|
||
|
typedef enum {SUCCESS = 0, FAIL = 1, BAD_HASHLEN = 2} HashReturn;
|
||
|
|
||
|
HashReturn jh_hash(int hashbitlen, const BitSequence *data, DataLength databitlen, BitSequence *hashval);
|