Lines Matching refs:aes
603 \index{blowfish\_desc} \index{xtea\_desc} \index{rc2\_desc} \index{rc5\_desc} \index{rc6\_desc} \index{saferp\_desc} \index{aes\_desc} \index{twofish\_desc}
616 \hline AES & aes\_desc & 16 & 16, 24, 32 & 10, 12, 14 \\
617 & aes\_enc\_desc & 16 & 16, 24, 32 & 10, 12, 14 \\
639 For AES, (also known as Rijndael) there are four descriptors which complicate issues a little. The descriptors
640 rijndael\_desc and rijndael\_enc\_desc provide the cipher named \textit{rijndael}. The descriptors aes\_desc and
641 aes\_enc\_desc provide the cipher name \textit{aes}. Functionally both \textit{rijndael} and \textit{aes} are the same cipher. The
877 length as the block size\footnote{In other words the size of a block of plaintext for the cipher, e.g. 8 for DES, 16 for AES, etc.}
1036 The key is specified as two strings the first key $K_1$ is the (normally AES) key and can be any length (typically 16, 24 or 32 octets long). The second key
1053 While LRW was specified to be used only with AES, LibTomCrypt will allow any 128--bit block cipher to be specified as indexed by \textit{cipher}. The
1243 This requires that the AES (or Rijndael) block cipher be registered with the cipher\_descriptor table first.
1347 block size (e.g. 16 bytes for AES).
1439 CCM is a NIST proposal for encrypt + authenticate that is centered around using AES
1481 This will return \textbf{CRYPT\_OK} if the CCM routine passes known test vectors. It requires AES or Rijndael to be registered previously, otherwise it will
1505 ccm_memory(find_cipher("aes"),
1522 ccm_memory(find_cipher("aes"),
1560 chosen must have a 16--byte block size (e.g., AES).
1719 /* register AES */
1724 gcm_init(&gcm, find_cipher("aes"), key, 16)) != CRYPT_OK) {
2015 applicable block ciphers (such as AES) can be turned into hash functions that other LTC functions can use. In
2037 Example of using CHC with the AES block cipher.
2055 /* start chc with AES */
2056 if ((err = chc_register(find_cipher("aes"))) != CRYPT_OK) {
2057 printf("Error binding AES to CHC: %s\n",
2201 algorithm which produces a Message Authentication Code (MAC) using only a block cipher such as AES. Note: OMAC has been standardized as
2214 of the cipher\footnote{The cipher must have a 64 or 128 bit block size. Such as CAST5, Blowfish, DES, AES, Twofish, etc.} you
2247 \textit{outlen} can be smaller than the default MAC size (for instance AES would make a 16-byte tag). Part of the OMAC
2248 specification states that the output may be truncated. So if you pass in $outlen = 5$ and use AES as your cipher than
2351 must have a 64 or 128 bit block size (e.x. AES).
2423 Pelican MAC is a new (experimental) MAC by the AES team that uses four rounds of AES as a \textit{mixing function}. It achieves a very high
2424 rate of processing and is potentially very secure. It requires AES to be enabled to function. You do not have to register\_cipher() AES first though
2425 as it calls AES directly.
2433 This will initialize the Pelican state with the given AES key. Once this has been done you can begin processing data.
2572 This will return \textbf{CRYPT\_OK} on success. This requires the AES or Rijndael descriptor be previously registered, otherwise, it will return
2658 This will return \textbf{CRYPT\_OK} on success. This requires the AES
2874 Fortuna is slightly less flexible than Yarrow in the sense that it only works with the AES block cipher
5269 of your block cipher (e.g. 16 bytes for AES). This means sadly if you're on a platform with 57--bit words (or something) you can't
5352 portable routines. For instance, hand optimized assembler versions of AES could be provided. Any existing function that uses the cipher could automatically use
5700 The \textit{CTR pad} is empty when a multiple (including zero) blocks of text have been processed. That is, if you pass in seven bytes to AES--CTR mode you would have to
