Skip to content
项目
群组
代码片段
帮助
正在加载...
帮助
为 GitLab 提交贡献
登录/注册
切换导航
H
h2database
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
分枝图
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
计划
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
分枝图
统计图
创建新议题
作业
提交
议题看板
打开侧边栏
Administrator
h2database
Commits
d8a28853
提交
d8a28853
authored
12月 26, 2015
作者:
Thomas Mueller Graf
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Supplemental hash function for long keys
上级
ffc00f89
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
404 行增加
和
0 行删除
+404
-0
CalculateHashConstantLong.java
h2/src/test/org/h2/test/store/CalculateHashConstantLong.java
+404
-0
没有找到文件。
h2/src/test/org/h2/test/store/CalculateHashConstantLong.java
0 → 100644
浏览文件 @
d8a28853
/*
* Copyright 2004-2014 H2 Group. Multiple-Licensed under the MPL 2.0,
* and the EPL 1.0 (http://h2database.com/html/license.html).
* Initial Developer: H2 Group
*/
package
org
.
h2
.
test
.
store
;
import
java.io.File
;
import
java.io.FileOutputStream
;
import
java.math.BigInteger
;
import
java.util.Arrays
;
import
java.util.BitSet
;
import
java.util.Collections
;
import
java.util.HashSet
;
import
java.util.Random
;
import
java.util.Set
;
import
java.util.concurrent.atomic.AtomicInteger
;
import
org.h2.security.AES
;
/**
* Calculate the constant for the secondary hash function, so that the hash
* function mixes the input bits as much as possible.
*/
public
class
CalculateHashConstantLong
implements
Runnable
{
private
static
BitSet
primeNumbers
=
new
BitSet
();
private
static
long
[]
randomValues
;
private
static
AtomicInteger
high
=
new
AtomicInteger
(
0x20
);
private
static
Set
<
Long
>
candidates
=
Collections
.
synchronizedSet
(
new
HashSet
<
Long
>());
private
long
constant
;
private
int
[]
fromTo
=
new
int
[
64
*
64
];
private
final
AES
aes
=
new
AES
();
{
aes
.
setKey
(
"Hello Welt Hallo Welt"
.
getBytes
());
}
private
final
byte
[]
data
=
new
byte
[
16
];
/**
* Run just this test.
*
* @param args ignored
*/
public
static
void
main
(
String
...
args
)
throws
Exception
{
for
(
int
i
=
0x0
;
i
<
0x10000
;
i
++)
{
if
(
BigInteger
.
valueOf
(
i
).
isProbablePrime
(
20
))
{
primeNumbers
.
set
(
i
);
}
}
randomValues
=
getRandomValues
(
1000
,
1
);
Random
r
=
new
Random
(
1
);
for
(
int
i
=
0
;
i
<
randomValues
.
length
;
i
++)
{
randomValues
[
i
]
=
r
.
nextInt
();
}
Thread
[]
threads
=
new
Thread
[
8
];
for
(
int
i
=
0
;
i
<
8
;
i
++)
{
threads
[
i
]
=
new
Thread
(
new
CalculateHashConstantLong
());
threads
[
i
].
start
();
}
for
(
int
i
=
0
;
i
<
8
;
i
++)
{
threads
[
i
].
join
();
}
int
finalCount
=
10000
;
long
[]
randomValues
=
getRandomValues
(
finalCount
,
10
);
System
.
out
.
println
();
System
.
out
.
println
(
"AES:"
);
CalculateHashConstantLong
test
=
new
CalculateHashConstantLong
();
int
[]
minMax
;
int
av
=
0
;
test
=
new
CalculateHashConstantLong
()
{
@Override
public
long
hash
(
long
x
)
{
return
secureHash
(
x
);
}
};
minMax
=
test
.
getDependencies
(
test
,
randomValues
);
System
.
out
.
println
(
"Dependencies: "
+
minMax
[
0
]
+
".."
+
minMax
[
1
]);
av
=
0
;
for
(
int
j
=
0
;
j
<
100
;
j
++)
{
av
+=
test
.
getAvalanche
(
test
,
randomValues
[
j
]);
}
System
.
out
.
println
(
"Avalanche: "
+
(
av
/
100
));
System
.
out
.
println
(
"AvalancheSum: "
+
av
);
minMax
=
test
.
getEffect
(
test
,
finalCount
*
10
,
11
);
System
.
out
.
println
(
"Effect: "
+
minMax
[
0
]
+
".."
+
minMax
[
1
]);
test
=
new
CalculateHashConstantLong
();
long
best
=
0
;
int
dist
=
Integer
.
MAX_VALUE
;
for
(
long
i
:
candidates
)
{
test
.
constant
=
i
;
System
.
out
.
println
();
System
.
out
.
println
(
"Constant: 0x"
+
Long
.
toHexString
(
i
));
minMax
=
test
.
getDependencies
(
test
,
randomValues
);
System
.
out
.
println
(
"Dependencies: "
+
minMax
[
0
]
+
".."
+
minMax
[
1
]);
int
d
=
minMax
[
1
]
-
minMax
[
0
];
av
=
0
;
for
(
int
j
=
0
;
j
<
100
;
j
++)
{
av
+=
test
.
getAvalanche
(
test
,
randomValues
[
j
]);
}
System
.
out
.
println
(
"AvalancheSum: "
+
av
);
minMax
=
test
.
getEffect
(
test
,
finalCount
*
10
,
11
);
System
.
out
.
println
(
"Effect: "
+
minMax
[
0
]
+
".."
+
minMax
[
1
]);
d
+=
minMax
[
1
]
-
minMax
[
0
];
if
(
d
<
dist
)
{
dist
=
d
;
best
=
i
;
}
}
System
.
out
.
println
();
System
.
out
.
println
(
"Best constant: 0x"
+
Long
.
toHexString
(
best
));
test
.
constant
=
best
;
long
collisions
=
test
.
getCollisionCount
();
System
.
out
.
println
(
"Collisions: "
+
collisions
);
}
/**
* Store a random file to be analyzed by the Diehard test.
*/
void
storeRandomFile
()
throws
Exception
{
File
f
=
new
File
(
System
.
getProperty
(
"user.home"
)
+
"/temp/rand.txt"
);
FileOutputStream
out
=
new
FileOutputStream
(
f
);
CalculateHashConstantLong
test
=
new
CalculateHashConstantLong
();
// Random r = new Random(1);
byte
[]
buff
=
new
byte
[
8
];
// tt.constant = 0x29a907;
for
(
int
i
=
0
;
i
<
10000000
/
8
;
i
++)
{
long
y
=
test
.
hash
(
i
);
// int y = r.nextInt();
writeLong
(
buff
,
0
,
y
);
out
.
write
(
buff
);
}
out
.
close
();
}
private
static
long
[]
getRandomValues
(
int
count
,
int
seed
)
{
long
[]
values
=
new
long
[
count
];
Random
r
=
new
Random
(
seed
);
for
(
int
i
=
0
;
i
<
count
;
i
++)
{
values
[
i
]
=
r
.
nextLong
();
}
return
values
;
}
@Override
public
void
run
()
{
while
(
true
)
{
int
currentHigh
=
high
.
getAndIncrement
();
// if (currentHigh > 0x2d) {
if
(
currentHigh
>
0xffff
)
{
break
;
}
System
.
out
.
println
(
"testing "
+
Integer
.
toHexString
(
currentHigh
)
+
"...."
);
addCandidates
(
currentHigh
);
}
}
private
void
addCandidates
(
long
currentHigh
)
{
for
(
int
low
=
0
;
low
<=
0xffff
;
low
++)
{
// the lower 16 bits don't have to be a prime number
// but it seems that's a good restriction
if
(!
primeNumbers
.
get
(
low
))
{
continue
;
}
long
i
=
(
currentHigh
<<
48
)
|
((
long
)
low
<<
32
)
|
(
currentHigh
<<
16
)
|
low
;
constant
=
i
;
// after one bit changes in the input,
// on average 32 bits of the output change
int
av
=
getAvalanche
(
this
,
0
);
if
(
Math
.
abs
(
av
-
28057
)
>
1000
)
{
continue
;
}
av
=
getAvalanche
(
this
,
0xffffffffffffffff
L
);
if
(
Math
.
abs
(
av
-
28057
)
>
1000
)
{
continue
;
}
long
es
=
getEffectSquare
(
this
,
randomValues
);
if
(
es
>
54379333
)
{
continue
;
}
int
[]
minMax
=
getEffect
(
this
,
10000
,
1
);
if
(!
isWithin
(
1500
,
10000
,
minMax
))
{
continue
;
}
minMax
=
getDependencies
(
this
,
randomValues
);
System
.
out
.
println
(
i
+
" minMax "
+
minMax
[
0
]
+
" "
+
minMax
[
1
]);
// aes: 117693..162049
if
(!
isWithin
(
13063
,
21744
,
minMax
))
{
continue
;
}
minMax
=
getEffect
(
this
,
100000
,
3
);
System
.
out
.
println
(
i
+
" minMax2 "
+
minMax
[
0
]
+
" "
+
minMax
[
1
]);
if
(!
isWithin
(
15143
,
82527
,
minMax
))
{
continue
;
}
System
.
out
.
println
(
Long
.
toHexString
(
i
)
+
" hit av:"
+
av
+
" bits:"
+
Long
.
bitCount
(
i
)
+
" es:"
+
es
+
" prime:"
+
BigInteger
.
valueOf
(
i
).
isProbablePrime
(
15
));
candidates
.
add
(
i
);
}
}
long
getCollisionCount
()
{
// TODO need a way to check this
return
0
;
}
private
static
boolean
isWithin
(
int
min
,
int
max
,
int
[]
range
)
{
return
range
[
0
]
>=
min
&&
range
[
1
]
<=
max
;
}
/**
* Calculate how much the bit changes (output bits that change if an input
* bit is changed) are independent of each other.
*
* @param h the hash object
* @param values the values to test with
* @return the minimum and maximum number of output bits that are changed in
* combination with another output bit
*/
int
[]
getDependencies
(
CalculateHashConstantLong
h
,
long
[]
values
)
{
Arrays
.
fill
(
fromTo
,
0
);
for
(
long
x
:
values
)
{
for
(
int
shift
=
0
;
shift
<
64
;
shift
++)
{
long
x1
=
h
.
hash
(
x
);
long
x2
=
h
.
hash
(
x
^
(
1L
<<
shift
));
long
x3
=
x1
^
x2
;
for
(
int
s
=
0
;
s
<
64
;
s
++)
{
if
((
x3
&
(
1L
<<
s
))
!=
0
)
{
for
(
int
s2
=
0
;
s2
<
64
;
s2
++)
{
if
(
s
==
s2
)
{
continue
;
}
if
((
x3
&
(
1L
<<
s2
))
!=
0
)
{
fromTo
[
s
*
64
+
s2
]++;
}
}
}
}
}
}
int
a
=
Integer
.
MAX_VALUE
,
b
=
Integer
.
MIN_VALUE
;
for
(
int
x
:
fromTo
)
{
if
(
x
==
0
)
{
continue
;
}
if
(
x
<
a
)
{
a
=
x
;
}
if
(
x
>
b
)
{
b
=
x
;
}
}
return
new
int
[]
{
a
,
b
};
}
/**
* Calculate the number of bits that change if a single bit is changed
* multiplied by 1000 (expected: 16000 +/- 5%).
*
* @param h the hash object
* @param value the base value
* @return the number of bit changes multiplied by 1000
*/
int
getAvalanche
(
CalculateHashConstantLong
h
,
long
value
)
{
int
changedBitsSum
=
0
;
for
(
int
i
=
0
;
i
<
64
;
i
++)
{
long
x
=
value
^
(
1L
<<
i
);
for
(
int
shift
=
0
;
shift
<
64
;
shift
++)
{
long
x1
=
h
.
hash
(
x
);
long
x2
=
h
.
hash
(
x
^
(
1L
<<
shift
));
long
x3
=
x1
^
x2
;
changedBitsSum
+=
Long
.
bitCount
(
x3
);
}
}
return
changedBitsSum
*
1000
/
64
/
64
;
}
/**
* Calculate the sum of the square of the distance to the expected
* probability that an output bit changes if an input bit is changed. The
* lower the value, the better.
*
* @param h the hash object
* @param values the values to test with
* @return sum(distance^2)
*/
long
getEffectSquare
(
CalculateHashConstantLong
h
,
long
[]
values
)
{
Arrays
.
fill
(
fromTo
,
0
);
int
total
=
0
;
for
(
long
x
:
values
)
{
for
(
int
shift
=
0
;
shift
<
64
;
shift
++)
{
long
x1
=
h
.
hash
(
x
);
long
x2
=
h
.
hash
(
x
^
(
1L
<<
shift
));
long
x3
=
x1
^
x2
;
for
(
int
s
=
0
;
s
<
64
;
s
++)
{
if
((
x3
&
(
1L
<<
s
))
!=
0
)
{
fromTo
[
shift
*
64
+
s
]++;
total
++;
}
}
}
}
long
sqDist
=
0
;
int
expected
=
total
/
64
/
64
;
for
(
int
x
:
fromTo
)
{
int
dist
=
Math
.
abs
(
x
-
expected
);
sqDist
+=
dist
*
dist
;
}
return
sqDist
;
}
/**
* Calculate if the all bit changes (that an output bit changes if an input
* bit is changed) are within a certain range.
*
* @param h the hash object
* @param count the number of values to test
* @param seed the random seed
* @return the minimum and maximum value of all input-to-output bit changes
*/
int
[]
getEffect
(
CalculateHashConstantLong
h
,
int
count
,
int
seed
)
{
Random
r
=
new
Random
();
r
.
setSeed
(
seed
);
Arrays
.
fill
(
fromTo
,
0
);
for
(
int
i
=
0
;
i
<
count
;
i
++)
{
long
x
=
r
.
nextLong
();
for
(
int
shift
=
0
;
shift
<
64
;
shift
++)
{
long
x1
=
h
.
hash
(
x
);
long
x2
=
h
.
hash
(
x
^
(
1L
<<
shift
));
long
x3
=
x1
^
x2
;
for
(
int
s
=
0
;
s
<
64
;
s
++)
{
if
((
x3
&
(
1L
<<
s
))
!=
0
)
{
fromTo
[
shift
*
64
+
s
]++;
}
}
}
}
int
a
=
Integer
.
MAX_VALUE
,
b
=
Integer
.
MIN_VALUE
;
for
(
int
x
:
fromTo
)
{
if
(
x
<
a
)
{
a
=
x
;
}
if
(
x
>
b
)
{
b
=
x
;
}
}
return
new
int
[]
{
a
,
b
};
}
/**
* The hash method.
*
* @param x the input
* @return the output
*/
long
hash
(
long
x
)
{
// return secureHash(x);
x
=
((
x
>>>
32
)
^
x
)
*
constant
;
x
=
((
x
>>>
32
)
^
x
)
*
constant
;
x
=
(
x
>>>
32
)
^
x
;
return
x
;
}
/**
* Calculate a hash using AES.
*
* @param x the input
* @return the output
*/
long
secureHash
(
long
x
)
{
Arrays
.
fill
(
data
,
(
byte
)
0
);
writeLong
(
data
,
0
,
x
);
aes
.
encrypt
(
data
,
0
,
16
);
return
readLong
(
data
,
0
);
}
private
static
void
writeLong
(
byte
[]
buff
,
int
pos
,
long
x
)
{
writeInt
(
buff
,
pos
,
(
int
)
(
x
>>>
32
));
writeInt
(
buff
,
pos
+
4
,
(
int
)
x
);
}
private
static
void
writeInt
(
byte
[]
buff
,
int
pos
,
int
x
)
{
buff
[
pos
++]
=
(
byte
)
(
x
>>
24
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
16
);
buff
[
pos
++]
=
(
byte
)
(
x
>>
8
);
buff
[
pos
++]
=
(
byte
)
x
;
}
private
static
long
readLong
(
byte
[]
buff
,
int
pos
)
{
return
(((
long
)
readInt
(
buff
,
pos
))
<<
32
)
|
readInt
(
buff
,
pos
+
4
);
}
private
static
int
readInt
(
byte
[]
buff
,
int
pos
)
{
return
(
buff
[
pos
++]
<<
24
)
+
((
buff
[
pos
++]
&
0xff
)
<<
16
)
+
((
buff
[
pos
++]
&
0xff
)
<<
8
)
+
(
buff
[
pos
]
&
0xff
);
}
}
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论