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:
  * </p>
- * <code>
- * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt()); <br />
- * </code>
+ * <pre>
+ * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
+ * </pre>
  * <p>
  * To check whether a plaintext password matches one that has been hashed previously, use
  * the checkpw method:
  * </p>
- * <code>
- * if (BCrypt.checkpw(candidate_password, stored_hash))<br />
- * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It matches");<br />
- * else<br />
- * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It does not match");<br />
- * </code>
+ * <pre>
+ * if (BCrypt.checkpw(candidate_password, stored_hash))
+ * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It matches");
+ * else<br>
+ * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It does not match");
+ * </pre>
  * <p>
  * The gensalt() method takes an optional parameter (log_rounds) that determines the
  * computational complexity of the hashing:
  * </p>
- * <code>
- * String strong_salt = BCrypt.gensalt(10)<br />
- * String stronger_salt = BCrypt.gensalt(12)<br />
- * </code>
+ * <pre>
+ * String strong_salt = BCrypt.gensalt(10)
+ * String stronger_salt = BCrypt.gensalt(12)
+ * </pre>
  * <p>
  * 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.