mirror of
https://github.com/mii443/RustySecrets.git
synced 2025-08-22 16:25:32 +00:00
add warning to README
This commit is contained in:
@ -6,6 +6,13 @@ A secret can be split into N shares in a way so that
|
||||
a selectable number of shares K (with K ≤ N) is required
|
||||
to reconstruct the secret again.
|
||||
|
||||
**Warning**: I don't yet recommend the serious use of this tool.
|
||||
I don't want to guarantee that shares computed with version 0.0.1
|
||||
can still be decoded with newer versions. For now, this is
|
||||
experimental. Also, I'm currently investigating whether my use
|
||||
of a non-prime field actually violates the information-theoretic
|
||||
security.
|
||||
|
||||
# Example
|
||||
|
||||
Passing a secret to secretshare for encoding:
|
||||
|
@ -292,11 +292,7 @@ fn main() {
|
||||
match action {
|
||||
Ok(Action::Encode(k,n)) => perform_encode(k, n, true),
|
||||
Ok(Action::Decode) => perform_decode(),
|
||||
Err(e) => {
|
||||
drop(writeln!(&mut stderr, "Error: {}", e));
|
||||
os::set_exit_status(1);
|
||||
return;
|
||||
}
|
||||
Err(e) => Err(other_io_err(e))
|
||||
};
|
||||
|
||||
if let Err(e) = result {
|
||||
@ -304,4 +300,3 @@ fn main() {
|
||||
os::set_exit_status(1);
|
||||
}
|
||||
}
|
||||
|
||||
|
Reference in New Issue
Block a user