mirror of https://github.com/M66B/FairEmail.git
141 lines
4.8 KiB
Java
141 lines
4.8 KiB
Java
/*
|
|
* BIP39 library, a Java implementation of BIP39
|
|
* Copyright (C) 2017-2019 Alan Evans, NovaCrypto
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
*
|
|
* Original source: https://github.com/NovaCrypto/BIP39
|
|
* You can contact the authors via github issues.
|
|
*/
|
|
|
|
package io.github.novacrypto.bip39;
|
|
|
|
import java.util.Arrays;
|
|
|
|
import static io.github.novacrypto.bip39.ByteUtils.next11Bits;
|
|
import static io.github.novacrypto.hashing.Sha256.sha256;
|
|
|
|
/**
|
|
* Generates mnemonics from entropy.
|
|
*/
|
|
public final class MnemonicGenerator {
|
|
|
|
private final WordList wordList;
|
|
|
|
/**
|
|
* Create a generator using the given word list.
|
|
*
|
|
* @param wordList A known ordered list of 2048 words to select from.
|
|
*/
|
|
public MnemonicGenerator(final WordList wordList) {
|
|
this.wordList = wordList;
|
|
}
|
|
|
|
public interface Target {
|
|
void append(final CharSequence string);
|
|
}
|
|
|
|
/**
|
|
* Create a mnemonic from the word list given the entropy.
|
|
*
|
|
* @param entropyHex 128-256 bits of hex entropy, number of bits must also be divisible by 32
|
|
* @param target Where to write the mnemonic to
|
|
*/
|
|
public void createMnemonic(
|
|
final CharSequence entropyHex,
|
|
final Target target) {
|
|
final int length = entropyHex.length();
|
|
if (length % 2 != 0)
|
|
throw new RuntimeException("Length of hex chars must be divisible by 2");
|
|
final byte[] entropy = new byte[length / 2];
|
|
try {
|
|
for (int i = 0, j = 0; i < length; i += 2, j++) {
|
|
entropy[j] = (byte) (parseHex(entropyHex.charAt(i)) << 4 | parseHex(entropyHex.charAt(i + 1)));
|
|
}
|
|
createMnemonic(entropy, target);
|
|
} finally {
|
|
Arrays.fill(entropy, (byte) 0);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Create a mnemonic from the word list given the entropy.
|
|
*
|
|
* @param entropy 128-256 bits of entropy, number of bits must also be divisible by 32
|
|
* @param target Where to write the mnemonic to
|
|
*/
|
|
public void createMnemonic(
|
|
final byte[] entropy,
|
|
final Target target) {
|
|
final int[] wordIndexes = wordIndexes(entropy);
|
|
try {
|
|
createMnemonic(wordIndexes, target);
|
|
} finally {
|
|
Arrays.fill(wordIndexes, 0);
|
|
}
|
|
}
|
|
|
|
private void createMnemonic(
|
|
final int[] wordIndexes,
|
|
final Target target) {
|
|
final String space = String.valueOf(wordList.getSpace());
|
|
for (int i = 0; i < wordIndexes.length; i++) {
|
|
if (i > 0) target.append(space);
|
|
target.append(wordList.getWord(wordIndexes[i]));
|
|
}
|
|
}
|
|
|
|
private static int[] wordIndexes(byte[] entropy) {
|
|
final int ent = entropy.length * 8;
|
|
entropyLengthPreChecks(ent);
|
|
|
|
final byte[] entropyWithChecksum = Arrays.copyOf(entropy, entropy.length + 1);
|
|
entropyWithChecksum[entropy.length] = firstByteOfSha256(entropy);
|
|
|
|
//checksum length
|
|
final int cs = ent / 32;
|
|
//mnemonic length
|
|
final int ms = (ent + cs) / 11;
|
|
|
|
//get the indexes into the word list
|
|
final int[] wordIndexes = new int[ms];
|
|
for (int i = 0, wi = 0; wi < ms; i += 11, wi++) {
|
|
wordIndexes[wi] = next11Bits(entropyWithChecksum, i);
|
|
}
|
|
return wordIndexes;
|
|
}
|
|
|
|
static byte firstByteOfSha256(final byte[] entropy) {
|
|
final byte[] hash = sha256(entropy);
|
|
final byte firstByte = hash[0];
|
|
Arrays.fill(hash, (byte) 0);
|
|
return firstByte;
|
|
}
|
|
|
|
private static void entropyLengthPreChecks(final int ent) {
|
|
if (ent < 128)
|
|
throw new RuntimeException("Entropy too low, 128-256 bits allowed");
|
|
if (ent > 256)
|
|
throw new RuntimeException("Entropy too high, 128-256 bits allowed");
|
|
if (ent % 32 > 0)
|
|
throw new RuntimeException("Number of entropy bits must be divisible by 32");
|
|
}
|
|
|
|
private static int parseHex(char c) {
|
|
if (c >= '0' && c <= '9') return c - '0';
|
|
if (c >= 'a' && c <= 'f') return (c - 'a') + 10;
|
|
if (c >= 'A' && c <= 'F') return (c - 'A') + 10;
|
|
throw new RuntimeException("Invalid hex char '" + c + '\'');
|
|
}
|
|
} |