diff options
author | lloyd <[email protected]> | 2013-04-04 17:54:01 +0000 |
---|---|---|
committer | lloyd <[email protected]> | 2013-04-04 17:54:01 +0000 |
commit | edc6851e89a33e0c2b2005fb5a079f9e91a5457e (patch) | |
tree | 42c4707eba35a4704d77640904b5213d569ae1d8 /doc/passhash.rst | |
parent | 1a9d22bd22653c2eeaed0d8098facacb39c80dc1 (diff) |
Fix RST syntax on superscript
Diffstat (limited to 'doc/passhash.rst')
-rw-r--r-- | doc/passhash.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/passhash.rst b/doc/passhash.rst index 2b311dc1a..f6445e2f6 100644 --- a/doc/passhash.rst +++ b/doc/passhash.rst @@ -38,7 +38,7 @@ each potential password, an attacker would have to compute the one way function output for all possible salts. It also prevents the same password from producing the same output, as long as the salts do not collide. Choosing n-bit salts randomly, salt collisions become likely -only after about 2:sup:`(n/2)` salts have been generated. Choosing a +only after about 2\ :sup:\ `(n/2)` salts have been generated. Choosing a large salt (say 80 to 128 bits) ensures this is very unlikely. Note that in password hashing salt collisions are unfortunate, but not fatal - it simply allows the attacker to attack those two passwords in |