|
Bouncy Castle Cryptography Library 1.86 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectorg.bouncycastle.crypto.threshold.ShamirSecretSplitter
| Nested Class Summary | |
static class |
ShamirSecretSplitter.Algorithm
|
static class |
ShamirSecretSplitter.Mode
Deprecated. no longer selects anything. Mode.Table indexed log/exp tables with the secret being split and with the share bytes, so which cache line it touched revealed them; both values now use the same constant-time arithmetic. Use #getInstance(Algorithm, int, SecureRandom),
which takes no mode. |
| Field Summary | |
protected int |
l
Length of the secret |
protected java.security.SecureRandom |
random
|
| Constructor Summary | |
ShamirSecretSplitter(ShamirSecretSplitter.Algorithm algorithm,
ShamirSecretSplitter.Mode mode,
int l,
java.security.SecureRandom random)
Deprecated. the mode is ignored - see ShamirSecretSplitter.Mode. Use
#getInstance(Algorithm, int, SecureRandom). |
|
| Method Summary | |
static ShamirSecretSplitter |
getInstance(ShamirSecretSplitter.Algorithm algorithm,
int l,
java.security.SecureRandom random)
Create a splitter using constant-time GF(256) arithmetic. |
SplitSecret |
resplit(byte[] secret,
int m,
int n)
Creates secret shares from a given secret. |
SplitSecret |
split(int m,
int n)
Creates secret shares. |
SplitSecret |
splitAround(SecretShare s,
int m,
int n)
Creates secret shares from a given secret share. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
protected int l
protected java.security.SecureRandom random
| Constructor Detail |
public ShamirSecretSplitter(ShamirSecretSplitter.Algorithm algorithm,
ShamirSecretSplitter.Mode mode,
int l,
java.security.SecureRandom random)
ShamirSecretSplitter.Mode. Use
#getInstance(Algorithm, int, SecureRandom).
| Method Detail |
public static ShamirSecretSplitter getInstance(ShamirSecretSplitter.Algorithm algorithm,
int l,
java.security.SecureRandom random)
algorithm - the reduction polynomial to work over.l - length in bytes of the secret to be split.random - source of randomness for the polynomial coefficients.
public SplitSecret split(int m,
int n)
SecretSplitter
split in interface SecretSplitterm - A threshold number of sharesn - Total number of shares
public SplitSecret splitAround(SecretShare s,
int m,
int n)
throws java.io.IOException
SecretSplitter
splitAround in interface SecretSplitterm - A threshold number of sharesn - Total number of shares
java.io.IOException
public SplitSecret resplit(byte[] secret,
int m,
int n)
SecretSplitter
resplit in interface SecretSplitterm - A threshold number of sharesn - Total number of shares
|
Bouncy Castle Cryptography Library 1.86 | |||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||