From 57a1cb9c8521a12d3ef5595f6dbf8035bed88d28 Mon Sep 17 00:00:00 2001 From: Dan Raviv Date: Sat, 7 Sep 2019 04:25:01 +0300 Subject: [PATCH] ch5 - Fix intro to seed generation examples Intro indicates all the examples are without any passphrase, even though one of the examples is with a passphrase. --- ch05.asciidoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch05.asciidoc b/ch05.asciidoc index 7ed43452..bcbf1899 100644 --- a/ch05.asciidoc +++ b/ch05.asciidoc @@ -222,7 +222,7 @@ image::images/mbc2_0507.png["From mnemonic to seed"] The key-stretching function, with its 2048 rounds of hashing, is a very effective protection against brute-force attacks against the mnemonic or the passphrase. It makes it extremely costly (in computation) to try more than a few thousand passphrase and mnemonic combinations, while the number of possible derived seeds is vast (2^512^). ==== -Tables pass:[#mnemonic_128_no_pass], pass:[#mnemonic_128_w_pass], and pass:[#mnemonic_256_no_pass] show some examples of mnemonic codes and the seeds they produce (without any passphrase). +Tables pass:[#mnemonic_128_no_pass], pass:[#mnemonic_128_w_pass], and pass:[#mnemonic_256_no_pass] show some examples of mnemonic codes and the seeds they produce (either with or without a passphrase). [[mnemonic_128_no_pass]] .128-bit entropy mnemonic code, no passphrase, resulting seed