From 14ea0669d3cfea4cce3903d2ab1fe0ce79f9add6 Mon Sep 17 00:00:00 2001 From: Yannick Badoual Date: Mon, 11 Jan 2016 15:34:50 +0100 Subject: [PATCH] Fixed javadoc issues --- .../telegram/mtproto/secure/aes/AESFastEngine.java | 7 ------- 1 file changed, 7 deletions(-) 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. - *

* For further details see: http://csrc.nist.gov/encryption/aes/. - *

* This implementation is based on optimizations from Dr. Brian Gladman's paper and C code at * http://fp.gladman.plus.com/cryptography_technology/rijndael/ - *

* 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 - *

* The fastest uses 8Kbytes of static tables to precompute round calculations, 4 256 word tables for encryption * and 4 for decryption. - *

* 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 - *

* The slowest version uses no static tables at all and computes the values in each round - *

* This file contains the fast version with 8Kbytes of static tables for round precomputation */ public class AESFastEngine {