Lines Matching refs:Well
136 You may be wondering, \textit{Tom, why did you write a crypto library. I already have one.} Well the reason falls into
149 know how to use Safer+, RC6, or Serpent as well. With all of the core functions there are central descriptor tables
181 you have to update the associated support code as well. In LibTomCrypt the associated code (\textit{chaining modes in this case})
219 There have been quite a few other people as well. Please check the change log to see who else has contributed from
296 There are 32 and 64-bit cyclic rotations as well:
661 defined will force the Twofish code to use pre-computed tables for the two s-boxes $q_0, q_1$ as well as the multiplication
813 OFB or Output Feedback Mode is a mode akin to CBC as well. It is given as:
1169 The mode can then process plaintext producing ciphertext as well as compute a partial checksum. The actual checksum
1817 Like the set of ciphers, the set of hashes have descriptors as well. They are stored in an array called \textit{hash\_descriptor} and
1846 There is a function to search the array as well called \textit{int find\_hash(char *name)}. It returns -1 if the hash is not found, otherwise, the
2663 The library provides an array of core functions for Pseudo-Random Number Generators (PRNGs) as well. A cryptographic PRNG is
2978 any RNG source. There is a function to help setup a PRNG as well:
2988 platform where the RNG does not work well. Example usage of this function is given below:
3244 The most often suggested value for $e$ is $65537$ since it is large enough to make such attacks impossible and also well
3559 /* if all went well pt == pt2, l2 == 16, res == 1 */
3602 The library provides a set of core ECC functions as well that are designed to be the Elliptic Curve analogy of all of the
3693 The library uses the following structure to describe an elliptic curve. This is used internally, as well as by the new
4658 \textit{outlen} elements. The \textit{inlen} field will be updated with the length of the decoded data type, as well as the respective entry in the \textit{list} field
4795 hash functions output. As such, it can easily be used to derive session keys for ciphers and MACs as well initial vectors as required
4883 The library includes primality testing and random prime functions as well. The primality tester will perform the test in
5159 the built--in LibTomMath descriptor as well (or in place of the TomsFastMath descriptor). Similarly, you can build the library with no built--in
5169 Note that even if you include the built--in descriptors you must link against the source library as well.
5175 This will compile \textit{myprogram} and link it against the LibTomCrypt library as well as TomsFastMath (which must have been previously installed). Note that
5188 This will build and install the library and link the shared object against the TomsFastMath library (which must be installed as a shared object as well). The
5210 Currently LibTomCrypt will detect x86-32, x86-64, MIPS R5900, SPARC and SPARC64 running GCC as well as x86-32 running MSVC.
5351 That works well for most cases but there are times where performance is of the essence. This API allows optimized routines to be dropped in--place of the existing
6398 free the bignum as well as the structure you allocated to place it in.
