| Modifier and Type | +Field and Description | +
|---|---|
private static int |
+BIT_HASH_LENGTH |
+
private static int |
+BYTE_HASH_LENGTH |
+
private byte[] |
+byte_state |
+
private static int |
+HASH_LENGTH |
+
private org.bouncycastle.jcajce.provider.digest.Keccak.Digest384 |
+keccak |
+
private static int |
+MAX_TRIT_VALUE |
+
private static int |
+MIN_TRIT_VALUE |
+
private static int |
+RADIX |
+
private int[] |
+trit_state |
+
| Modifier and Type | +Method and Description | +
|---|---|
Kerl |
+absorb(int[] trits,
+ int offset,
+ int length)
+Absorbs the specified trits.
+ |
+
Kerl |
+clone()
+Clones this instance.
+ |
+
private static byte[] |
+convertBigintToBytes(BigInteger value,
+ int size) |
+
private static int[] |
+convertBigintToTrits(BigInteger value,
+ int size) |
+
private static BigInteger |
+convertBytesToBigInt(byte[] bytes,
+ int offset,
+ int size) |
+
static BigInteger |
+convertTritsToBigint(int[] trits,
+ int offset,
+ int size) |
+
Kerl |
+reset()
+Resets this state.
+ |
+
int[] |
+squeeze(int[] trits)
+Squeezes the specified trits.
+ |
+
int[] |
+squeeze(int[] trits,
+ int offset,
+ int length)
+Squeezes the specified trits.
+ |
+
private static final int HASH_LENGTH+
private static final int BIT_HASH_LENGTH+
private static final int BYTE_HASH_LENGTH+
private static final int RADIX+
private static final int MAX_TRIT_VALUE+
private static final int MIN_TRIT_VALUE+
private final org.bouncycastle.jcajce.provider.digest.Keccak.Digest384 keccak+
private byte[] byte_state+
private int[] trit_state+
public static BigInteger convertTritsToBigint(int[] trits, + int offset, + int size)+
private static BigInteger convertBytesToBigInt(byte[] bytes, + int offset, + int size)+
private static int[] convertBigintToTrits(BigInteger value, + int size)+
private static byte[] convertBigintToBytes(BigInteger value, + int size)+
public Kerl absorb(int[] trits, + int offset, + int length)+
JCurlpublic int[] squeeze(int[] trits, + int offset, + int length)+
JCurlpublic int[] squeeze(int[] trits)+
Copyright © 2017. All rights reserved.
+ +