Line 0
Link Here
|
|
|
1 |
--- apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java.orig 2019-04-17 11:58:51.939865000 -0400 |
2 |
+++ apps/i2pcontrol/java/org/mindrot/jbcrypt/BCrypt.java 2019-04-17 11:58:57.299331000 -0400 |
3 |
@@ -32,25 +32,25 @@ |
4 |
* call the hashpw method with a random salt, like this: |
5 |
* <p> |
6 |
* <code> |
7 |
- * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt()); <br /> |
8 |
+ * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt()); |
9 |
* </code> |
10 |
* <p> |
11 |
* To check whether a plaintext password matches one that has been |
12 |
* hashed previously, use the checkpw method: |
13 |
* <p> |
14 |
* <code> |
15 |
- * if (BCrypt.checkpw(candidate_password, stored_hash))<br /> |
16 |
- * System.out.println("It matches");<br /> |
17 |
- * else<br /> |
18 |
- * System.out.println("It does not match");<br /> |
19 |
+ * if (BCrypt.checkpw(candidate_password, stored_hash)) |
20 |
+ * System.out.println("It matches"); |
21 |
+ * else |
22 |
+ * System.out.println("It does not match"); |
23 |
* </code> |
24 |
* <p> |
25 |
* The gensalt() method takes an optional parameter (log_rounds) |
26 |
* that determines the computational complexity of the hashing: |
27 |
* <p> |
28 |
* <code> |
29 |
- * String strong_salt = BCrypt.gensalt(10)<br /> |
30 |
- * String stronger_salt = BCrypt.gensalt(12)<br /> |
31 |
+ * String strong_salt = BCrypt.gensalt(10) |
32 |
+ * String stronger_salt = BCrypt.gensalt(12) |
33 |
* </code> |
34 |
* <p> |
35 |
* The amount of work increases exponentially (2**log_rounds), so |