Lines Matching refs:Such
123 The library was designed such that new ciphers/hashes/PRNGs can be added at run-time and the existing API
132 provide all of the tools required to build such functionality. LibTomCrypt was designed to be a flexible library that
161 with \textit{cycles per byte} timings that are comparable (and often favourable) to other libraries such as OpenSSL and
319 Certain functions such as (for example) \textit{rsa\_export()} give an output that is variable length. To prevent buffer overflows you
360 Certain functions such as \textit{rsa\_make\_key()} require a Pseudo Random Number Generator (PRNG). These functions do not setup
364 may be passed as \textbf{NULL} in such situations.
395 must pass in (a pointer to) an array of 32 \textit{unsigned char} variables. Certain routines (such as SAFER+) take
555 ciphers are configured such that the default number of rounds provide adequate security for the given block and key
647 The \textit{encrypt only} descriptors are useful for applications that only use the encryption function of the cipher. Algorithms such
729 Which accepts a pointer to a descriptor and returns the index into the global descriptor table. If an error occurs such
1072 of 16. The LRW code uses a fast tweak update such that consecutive blocks are encrypted faster than if random seeking where used.
1192 When this function completes, the \textit{eax} state will be initialized such that you can now either have data decrypted or
2015 applicable block ciphers (such as AES) can be turned into hash functions that other LTC functions can use. In
2072 The other hashes such as the SHA-1, SHA-2 (that includes SHA-512, SHA-384 and SHA-256) and TIGER-192 are still considered secure
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
2664 used to expand a shorter bit string into a longer bit string. PRNGs are used wherever random data is required such as Public Key (PK)
3024 It is possible to access the secure RNG through the PRNG interface, and in turn use it within dependent functions such
3231 $\mbox{lcm}(p - 1, q - 1)$. The public key consists of the composite $N$ and some integer $e$ such that
3235 A person who wants to encrypt with your public key simply forms an integer (the plaintext) $M$ such that
3244 The most often suggested value for $e$ is $65537$ since it is large enough to make such attacks impossible and also well
3251 the hash of documents only but also to pad the inputs with data to remove such structure.
3441 values such as $\lbrace$\textbf{NULL}, 0, 0$\rbrace$.
3621 The variable $b$ is chosen such that the number of points is nearly maximal. In fact the order of the base points $\beta$
3630 supported by any conforming math plugin. It is enabled by defining \textbf{MECC\_FP} during the build, such as
3637 safe (by default). It supports the LTC locking macros (such as by enabling LTC\_PTHREAD), but by default is not locked.
3872 The data is encrypted to the public ECC \textit{key} such that only the holder of the private key can decrypt the payload. To have multiple
4279 (in certain cases). For types such as IA5 STRING, BIT STRING, OCTET STRING (etc) the \textit{size} field is updated after successful decoding to reflect how many
4334 It is ideal that you cast the \textit{size} values to unsigned long to ensure that the proper data type is passed to the function. Constants such as \textit{1} without
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
5017 such as register\_cipher() are not thread safe no matter what you do. It is best to call them from your programs initialization
5020 The rest of the code uses state variables you must pass it such as hash\_state, hmac\_state, etc. This means that if each
5026 pthreads based mutex locking in various routines such as the Yarrow and Fortuna PRNGs, the fixed point ECC multiplier, and other routines.
5035 LibTomCrypt no longer provides a math API on its own and relies on third party libraries (such as LibTomMath, GnuMP, or TomsFastMath).
5247 This mode (auto-detected with x86\_32,x86\_64 platforms with GCC or MSVC) configures various routines such as ctr\_encrypt() or
5311 When this is defined some of the code such as the Rijndael and SAFER+ ciphers are replaced with smaller code variants.
5348 to be highly portable and easy to build out of the box on pretty much any platform. As such there are no assembler inlines throughout the code, I make no assumptions
6413 /** A point on a ECC curve, stored in Jacobian format such
