diff options
Diffstat (limited to 'spec/rend-spec-v3/recommendations-for-searching-for-vanity-onions.md')
| -rw-r--r-- | spec/rend-spec-v3/recommendations-for-searching-for-vanity-onions.md | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/spec/rend-spec-v3/recommendations-for-searching-for-vanity-onions.md b/spec/rend-spec-v3/recommendations-for-searching-for-vanity-onions.md index 3c7142b..f07d108 100644 --- a/spec/rend-spec-v3/recommendations-for-searching-for-vanity-onions.md +++ b/spec/rend-spec-v3/recommendations-for-searching-for-vanity-onions.md @@ -1,6 +1,6 @@ <a id="rend-spec-v3.txt-C"></a> -# Appendix C: Recommendations for searching for vanity .onions [VANITY] +# Appendix C: Recommendations for searching for vanity .onions \[VANITY\] EDITORIAL NOTE: The author thinks that it's silly to brute-force the keyspace for a key that, when base-32 encoded, spells out the name of @@ -30,16 +30,16 @@ While pk does not satisfy X: Return sk, pk. ``` -We add 8 and 8*B, rather than 1 and B, so that sk is always a valid +We add 8 and 8\*B, rather than 1 and B, so that sk is always a valid Curve25519 private key, with the lowest 3 bits equal to 0. -This algorithm is safe [source: djb, personal communication] [TODO: -Make sure I understood correctly!] so long as only the final (sk,pk) +This algorithm is safe \[source: djb, personal communication\] \[TODO: +Make sure I understood correctly!\] so long as only the final (sk,pk) pair is used, and all previous values are discarded. To parallelize this algorithm, start with an independent (sk,pk) pair generated for each independent thread, and let each search proceed independently. -See [VANITY-REFS] for a reference implementation of this vanity .onion +See \[VANITY-REFS\] for a reference implementation of this vanity .onion search scheme. |