diff --git a/mtproto/src/main/java/com/github/badoualy/telegram/mtproto/secure/aes/AESFastEngine.java b/mtproto/src/main/java/com/github/badoualy/telegram/mtproto/secure/aes/AESFastEngine.java
index f4e72969a..e585249d9 100644
--- a/mtproto/src/main/java/com/github/badoualy/telegram/mtproto/secure/aes/AESFastEngine.java
+++ b/mtproto/src/main/java/com/github/badoualy/telegram/mtproto/secure/aes/AESFastEngine.java
@@ -3,24 +3,17 @@
 
 /**
  * an implementation of the AES (Rijndael), from FIPS-197.
- * <p/>
  * For further details see: <a href="http://csrc.nist.gov/encryption/aes/">http://csrc.nist.gov/encryption/aes/</a>.
- * <p/>
  * This implementation is based on optimizations from Dr. Brian Gladman's paper and C code at
  * <a href="http://fp.gladman.plus.com/cryptography_technology/rijndael/">http://fp.gladman.plus.com/cryptography_technology/rijndael/</a>
- * <p/>
  * There are three levels of tradeoff of speed vs memory
  * Because java has no preprocessor, they are written as three separate classes from which to choose
- * <p/>
  * The fastest uses 8Kbytes of static tables to precompute round calculations, 4 256 word tables for encryption
  * and 4 for decryption.
- * <p/>
  * The middle performance version uses only one 256 word table for each, for a total of 2Kbytes,
  * adding 12 rotate operations per round to compute the values contained in the other tables from
  * the contents of the first
- * <p/>
  * The slowest version uses no static tables at all and computes the values in each round
- * <p/>
  * This file contains the fast version with 8Kbytes of static tables for round precomputation
  */
 public class AESFastEngine {