Meishin/LoginSystem
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Minor: replace self-closing tags in javadoc

Browse Source
This commit is contained in:
ljacqu 2016-01-18 15:17:02 +01:00
parent 07e7a8815b
commit 393f1a0f36
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/main/java/fr/xephi/authme/security/crypts/BCryptService.java
View File

@ -33,25 +33,25 @@ import java.security.SecureRandom;
* call the hashpw method with a random salt, like this: * call the hashpw method with a random salt, like this:
* <p> * <p>
* <code> * <code>
* String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt()); <br /> * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt()); <br>
* </code> * </code>
* <p> * <p>
* To check whether a plaintext password matches one that has been * To check whether a plaintext password matches one that has been
* hashed previously, use the checkpw method: * hashed previously, use the checkpw method:
* <p> * <p>
* <code> * <code>
* if (BCrypt.checkpw(candidate_password, stored_hash))<br /> * if (BCrypt.checkpw(candidate_password, stored_hash))<br>
* &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It matches");<br /> * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It matches");<br>
* else<br /> * else<br>
* &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It does not match");<br /> * &nbsp;&nbsp;&nbsp;&nbsp;System.out.println("It does not match");<br>
* </code> * </code>
* <p> * <p>
* The gensalt() method takes an optional parameter (log_rounds) * The gensalt() method takes an optional parameter (log_rounds)
* that determines the computational complexity of the hashing: * that determines the computational complexity of the hashing:
* <p> * <p>
* <code> * <code>
* String strong_salt = BCrypt.gensalt(10)<br /> * String strong_salt = BCrypt.gensalt(10)<br>
* String stronger_salt = BCrypt.gensalt(12)<br /> * String stronger_salt = BCrypt.gensalt(12)<br>
* </code> * </code>
* <p> * <p>
* The amount of work increases exponentially (2**log_rounds), so * The amount of work increases exponentially (2**log_rounds), so