Repository navigation
Home
ZQ edited this page Jan 29, 2018
·
2 revisions
This is part of toolchain in paper "XXX". It is still under development, so there may exist some bugs. But we claim the correctness under our provided data input.
The tool is built upon a version of art-of-state SAT solver (cryptominisat5).
- src: forked from cryptominisat5
- jmc: Counting code described in Section IV.A
mkdir build;
sh ../cmake.sh;
make -j4;
You will get a build/cmsat5-jmc, the tool is called jmc;
Run jmc --help to see basic parameter description.
- data: constraint files (CNF format with defined secret, attacker, observable, and other input) and running scripts we used for experiments in Section V and VI
- data/micro RUN ./run.sh (be sure to set the tool path to your jmc's path) Computation time should vary based on your parameter choice. The setting in the script works well to finish within minutes in our testbed.
- data/case The constraints used in section VI is complexed and the input size ranges from 3 bytes to 1000+ bytes. Thus, computation time could be up to hours. Reducing the confidence or increasing error tolerance would speed up the process.
This version is single threaded and limited to one set size per run. A robust multi-threaded version is still under development; However, you still could run multiple jmc for different secrets set size at the same time to parallelize the generation of Jn figure
- Too Slow: check whether you have installed the libm4ri-dev and enable DUSE_GAUSS option. If not, the XOR constraint we used in counting should largely slow down the computation.