From 1b2710138f45e208c68fa607dbd0ff4c93543084 Mon Sep 17 00:00:00 2001 From: Dung Ta Van Date: Thu, 21 Jul 2022 22:54:37 +0700 Subject: [PATCH] update BCrypt docs --- .../com/tvd12/ezyfox/security/BCrypt.java | 26 +++++++++---------- 1 file changed, 13 insertions(+), 13 deletions(-) diff --git a/ezyfox-security/src/main/java/com/tvd12/ezyfox/security/BCrypt.java b/ezyfox-security/src/main/java/com/tvd12/ezyfox/security/BCrypt.java index d25261f4..3683bab9 100644 --- a/ezyfox-security/src/main/java/com/tvd12/ezyfox/security/BCrypt.java +++ b/ezyfox-security/src/main/java/com/tvd12/ezyfox/security/BCrypt.java @@ -32,27 +32,27 @@ * Usage is really simple. To hash a password for the first time, call the hashpw method * with a random salt, like this: *

- * - * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
- *
+ *
+ * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
+ * 
*

* To check whether a plaintext password matches one that has been hashed previously, use * the checkpw method: *

- * - * if (BCrypt.checkpw(candidate_password, stored_hash))
- *     System.out.println("It matches");
- * else
- *     System.out.println("It does not match");
- *
+ *
+ * if (BCrypt.checkpw(candidate_password, stored_hash))
+ *     System.out.println("It matches");
+ * else
+ *     System.out.println("It does not match"); + *
*

* The gensalt() method takes an optional parameter (log_rounds) that determines the * computational complexity of the hashing: *

- * - * String strong_salt = BCrypt.gensalt(10)
- * String stronger_salt = BCrypt.gensalt(12)
- *
+ *
+ * String strong_salt = BCrypt.gensalt(10)
+ * String stronger_salt = BCrypt.gensalt(12)
+ * 
*

* The amount of work increases exponentially (2**log_rounds), so each increment is twice * as much work. The default log_rounds is 10, and the valid range is 4 to 31.