fletcher / c-sss Goto Github PK

Hi all,

having a problem building the project using make from /build directory

OS: Ubuntu 18.04.1 LTS
cmake version: 3.10.2

Scanning dependencies of target libShamir
[ 11%] Building C object CMakeFiles/libShamir.dir/src/shamir.c.o
[ 22%] Building C object CMakeFiles/libShamir.dir/src/strtok.c.o
[ 33%] Linking C static library libShamir.a
[ 33%] Built target libShamir
Scanning dependencies of target shamir
[ 44%] Building C object CMakeFiles/shamir.dir/src/main.c.o
[ 55%] Building C object CMakeFiles/shamir.dir/src/d_string.c.o
[ 66%] Linking C executable shamir
/usr/bin/ld: cannot find -lbsd
collect2: error: ld returned 1 exit status
CMakeFiles/shamir.dir/build.make:121: recipe for target 'shamir' failed
make[2]: *** [shamir] Error 1
CMakeFiles/Makefile2:67: recipe for target 'CMakeFiles/shamir.dir/all' failed
make[1]: *** [CMakeFiles/shamir.dir/all] Error 2
Makefile:151: recipe for target 'all' failed
make: *** [all] Error 2

line517: the memory malloc by strdup that temp_string ponited is not free

The generated coefficients can be 0. Though improbable, if all coefficients are 0, all the shares would be the secret.

In general, the fact that the random generator can produce 0 introduces the risk of lower-order polynomials and therefore a risk of a lower number of shares needed to recover the share than required.

Hi all,

having a problem when running the project in vs2019, in shamir.c (137,12): error C2466: cannot allocate an array of constant size 0
Before this step, I have generated the cmake project to fit in vs2019 using cmake gui tools
OS: win10
IDE: Visual Studio 2019

int * split_number(int number, int n, int t) {
    int * shares = malloc(sizeof(int) * n);
int coef[t];
int x;
int i;

by the way,what steps should I follow to run the code normally after downloading the project？can you give me some suggestions? Thank you!!!!!!

hi fletcher,
Can you trigger some ideas for implementing of SSS in Distributed memory

Thanks for your code and program!
I use your program in the experience of my paper. The function generate_share_strings() takes 1133s to generate share strings of a 1MB text file, but extract_secret_from_share_strings() takes 106s. This is different from what I expected. I created 100 shares and the threshold is 50.
Does generate_share_strings() take much more time than extract_secret_from_share_strings() ?

There seems to be a bug that causes the decryption process to fail sometimes. If the revealed secret doesn't look right, simply rerun the command. When this happens, either the whole secret works, or it doesn't -- there won't be one incorrect character surrounded by correct characters.

Hi all,
I'm sorry that the errors are still existing.
I downloaded the latest version, and used the cmake-gui tool to generate the vs project,but when debuging the project in vs2019, it still display the errrors.

So I guess maybe my steps or my tools could not fit the source code. At the same time, I could not find the directions in the README（except for the "About the Source"） about choosing which tools to run the program and the documentation link is banned. Could you share your tools(softwear) and your steps in deatils about running the source code? Thanks a lot!!!!!!!

Originally posted by @lamcrazy in #9 (comment)

Hi all,
I'm sorry that the errors are still existing.
I downloaded the latest version, and used the cmake-gui tool to generate the vs project,but when debuging the project in vs2019, it still display the errrors.

So I guess maybe my steps or my tools could not fit the source code. At the same time, I could not find the directions in the README（except for the "About the Source"） about choosing which tools to run the program and the documentation link is banned. Could you share your tools(softwear) and your steps in deatils about running the source code? Thanks a lot!!!!!!!

Originally posted by @lamcrazy in #9 (comment)