-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 > AFAIK, ssss *is* an implementation of SSS. So, why would you write > a new version? > > I must say I didn't look at the source, as I do not see the point > at first. > > So, this is a warning about security issues : something you made > yourself is likely to be unsafe. A tested implementation exists. > > Maybe is there really a point in writing it, but I can't see which. > Maybe if you explained what the limitations of ssss are...? > > HTH, > > Leo >
Hello, The demo of ssss shows : - - a secret limited to 128 characters - - a generation of n fragments in once pass. You couldn't generate a new fragment later - - you have to copy paste each fragments after splitting, and right again on combination Plus, in the source code, you can see it is not using the modulo part, needing a specific lib (if I understood well). Finally, when I tried it on the demo page, if I enter less fragments than needed, it seems to raise an error which can help into discovering how much fragments are needed. In the end, it was a good exercise for me and I wanted to share it. And as a Python version it is runnable everywhere without compiling which seems to be a problem with the last version of ssss. regards, - -- Mindiell -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://www.enigmail.net/ iF4EAREIAAYFAlKtofQACgkQUrT9WwBwY7xd4wD9HCDe/Rb6uNZTvT+Jlm1SZLVU k2+hl/971LMU8EcBSzwA/RSJE+CV0+vdrwKWOZyK2XQp5du3lsH69SAic5RU9IRm =L9PN -----END PGP SIGNATURE----- _______________________________________________ Gnupg-users mailing list Gnupg-users@gnupg.org http://lists.gnupg.org/mailman/listinfo/gnupg-users
