Optimised ANSI C code for the Rijndael cipher (now AES)Authors:    Vincent Rijmen <vincent.rijmen@esat.kuleuven.ac.be>    Antoon Bosselaers <antoon.bosselaers@esat.kuleuven.ac.be>    Paulo Barreto <paulo.barreto@terra.com.br>All code contained in this distributed is placed in the public domain.========================================================================Disclaimer:THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ========================================================================Acknowledgements:We are deeply indebted to the following people for their bug reports,fixes, and improvement suggestions to the API implementation. Though wetried to list all contributions, we apologise in advance for anymissing reference:Andrew Bales <Andrew.Bales@Honeywell.com>Markus Friedl <markus.friedl@informatik.uni-erlangen.de>John Skodon <skodonj@webquill.com>========================================================================Description:This optimised implementation of Rijndael is noticeably faster than theprevious versions on Intel processors under Win32 w/ MSVC 6.0.  On thesame processor under Linux w/ gcc-2.95.2, the key setup is alsoconsiderably faster, but normal encryption/decryption is only marginallyfaster.To enable full loop unrolling for encryption/decryption, define theconditional compilation directive FULL_UNROLL.  This may help increaseperformance or not, depending on the platform.To compute the intermediate value tests, define the conditionalcompilation directive INTERMEDIATE_VALUE_KAT.  It may be worthwhile todefine the TRACE_KAT_MCT directive too, which provides useful progressinformation during the generation of the KAT and MCT sets.========================================================================Contents:README                  This filerijndael-alg-fst.c      The algorithm implementation.rijndael-alg-fst.h      The corresponding header file.rijndael-api-fst.c      NIST's implementation.rijndael-api-fst.h      The corresponding header file.rijndael-test-fst.c     A simple program to generate test vectors.table.128               Data for the table tests and 128-bit keys.table.192               Data for the table tests and 192-bit keys.table.256               Data for the table tests and 256-bit keys.fips-test-vectors.txt   Key schedule and ciphertext intermediate values                        (reduced set proposed for FIPS inclusion).Makefile                A sample makefile; may need some changes,                        depending on the C compiler used.N.B. Both the API implementation and the provisional reduced set oftest vectors are likely to change, according to NIST's final decisionregarding modes of operation and the FIPS contents. They are thereforemarked as "version 2.9" rather than "version 3.0".