From 4c4bff3ed559ede6e1664438069de0b87a36687d Mon Sep 17 00:00:00 2001 From: nadams Date: Mon, 24 Apr 2017 08:10:10 -0700 Subject: [PATCH] Edited ch05.asciidoc with Atlas code editor --- ch05.asciidoc | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/ch05.asciidoc b/ch05.asciidoc index 336246b1..01abe419 100644 --- a/ch05.asciidoc +++ b/ch05.asciidoc @@ -178,7 +178,7 @@ Mnemonic words are generated automatically by the wallet, using a standardized p image::images/mbc2_0506.png["Generating entropy and encoding as mnemonic words"] <> shows the relationship between the size of entropy data and the length of mnemonic codes in words. -+ + [[table_4-5]] .Mnemonic codes: entropy and word length [options="header"] @@ -202,7 +202,7 @@ The process described in steps 7 through 9 continues from the process described ++++
    -
  1. The first parameter to the PBKDF2 key-stretching function is the _mnemonic_ produced from step 6 in #generating_mnemonic_words.
    2. +
  2. The first parameter to the PBKDF2 key-stretching function is the mnemonic produced from step 6 in #generating_mnemonic_words.
  3. The second parameter to the PBKDF2 key-stretching function is a salt. The salt is composed of the string constant "mnemonic" concatenated with an optional user-supplied passphrase string.
  4. PBKDF2 stretches the mnemonic and salt parameters using 2048 rounds of hashing with the HMAC-SHA512 algorithm, producing a 512-bit value as its final output. That 512-bit value is the seed.
@@ -216,7 +216,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 (without any passphrase). [[mnemonic_128_no_pass]] .128-bit entropy mnemonic code, no passphrase, resulting seed