chain Length
=
chain Length RCrack
− 1
keyspace
=
character Set Length
i
=
character Set Length
− character Set Length
table Work Factor
=
chain Length
∙ chain Count
total Work Factor
=
number Of Tables
∙
table Work Factor
pre work
=
chain Length
∙ (chain Length
+ 1)
2
brute Force Point
≲
pre work
∙ number Of Tables
expected Unique Chains
=
euc(
chain Length
)
≈
euc(
i) =
keyspace
∙
(
1 −
e
)
table Generation Time
=
keyspace
∙ table Work Factor
=
chain Count
∙ chain Length
perfect Table Success Rate
≈ 1 −
(
1 −
≈ 1 −
(
1 −
imperfect Table Success Rate
≈ 1 −
(
1 −
)
total Success Rate
≈ 1 −
(
1 − table Success Rate
i
)
≈
1 − (1 − table Success Rate
)
≈
1
chain Length
∙ (1 − (1 − perfect Table Success Rate
)
)
−
perfect Table Success Rate
≈ 1 −
(
1 −
chain Count
≈
1 −
expected Unique Chains
∙ chain Length
chain Count
≈
√
number Of Tables
∙ brute Force Point
+ 1
− 1
2
table Success Rate
≈ 1 − (1 − total Success Rate
)
min Tables
=
ceiling
(
log(1 − total Success Rate
)
log(1 − max Table Success Rate
)
)
max Table Success Rate
> 0.859