phantom/mkp224o
1
0
Fork 0
mirror of https://github.com/cathugger/mkp224o.git synced 2025-01-25 02:02:57 -03:00
Code Issues Projects Releases Packages Wiki Activity Actions

estimate calc utility (WIP)

Browse source
This commit is contained in:
cathugger 2020-01-14 17:15:44 +00:00
parent d3640b7322
commit e6d0f59f1d
No known key found for this signature in database
GPG key ID: 9BADDA2DAF6F01A8
2 changed files with 49 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
GNUmakefile.in
View file

@ -31,8 +31,8 @@ MAIN_OBJ= \
$(ED25519_OBJ) \
keccak.c.o
UTIL_CALCDIFF_OBJ= \
calcdiff.c.o
UTIL_CALCEST_OBJ= \
calcest.c.o
TEST_BASE64_OBJ= \
test_base64.c.o \
@ -69,10 +69,11 @@ ALL_C= $(patsubst %.c.o,%.c,$(filter %.c.o %.c,$(ALL_O)))
CLEAN_O= $(filter %.o,$(ALL_O))
MAIN_LIB= -lpthread -lsodium @MAINLIB@
UTIL_CALCEST_LIB= -lm
TEST_ED25519_LIB= -lsodium
MAIN_TGT= mkp224o
UTIL_TGT= calcdiff
UTIL_TGT= calcest
TEST_TGT= test_base64 test_base32 test_base16 test_ed25519
MAIN_EXE= $(patsubst %,%@EXEEXT@,$(MAIN_TGT))
@ -90,8 +91,8 @@ all: $(ALL_EXE)
mkp224o@EXEEXT@: $(MAIN_OBJ)
$(CC) $(LDFLAGS) $(CFLAGS) -o $@.tmp $^ $(MAIN_LIB) && $(MV) $@.tmp $@
calcdiff@EXEEXT@: $(UTIL_CALCDIFF_OBJ)
$(CC) $(LDFLAGS) $(CFLAGS) -o $@.tmp $^ && $(MV) $@.tmp $@
calcest@EXEEXT@: $(UTIL_CALCEST_OBJ)
$(CC) $(LDFLAGS) $(CFLAGS) -o $@.tmp $^ $(UTIL_CALCEST_LIB) && $(MV) $@.tmp $@
test_base64@EXEEXT@: $(TEST_BASE64_OBJ)
$(CC) $(LDFLAGS) $(CFLAGS) -o $@.tmp $^ && $(MV) $@.tmp $@

43
calcest.c Normal file
View file

@ -0,0 +1,43 @@
#include <stdio.h>
#include <math.h>
/*
* as per scribblemaniac's explanation:
* t - number of trials
* n - character count
* p - probability
* condition: >=1 matches
* formula: t = log(1-p)/log(1-1/32^n)
* comes from:
* distribution X~Binomial(t, 1/32^n)
* P(X>=1)=p
*/
const double probs[] = { 0.5, 0.8, 0.9, 0.95, 0.99 };
const int charcounts[] = { 2, 3, 4, 5, 6, 7 };
int main(void)
{
printf(" |");
for (int i = 0; i < sizeof(probs)/sizeof(probs[0]); ++i) {
printf(" %11d%% |",(int)((probs[i]*100)+0.5));
}
printf("\n");
printf("---+");
for (int i = 0; i < sizeof(probs)/sizeof(probs[0]); ++i) {
printf("--------------+");
}
printf("\n");
for (int i = 0; i < sizeof(charcounts)/sizeof(charcounts[0]); ++i) {
printf("%2d |",charcounts[i]);
for (int j = 0; j < sizeof(probs)/sizeof(probs[0]); ++j) {
double t = log2(1 - probs[j]) / log2(1 - (1 / pow(32,charcounts[i])));
printf(" %12.0f |",t);
}
printf("\n");
}
return 0;
}