Lines Matching refs:At
123 The library was designed such that new ciphers/hashes/PRNGs can be added at run-time and the existing API
150 that can be used to make a program automatically pick between ciphers, hashes and PRNGs at run-time. That means your
546 keys (mainly for test vectors anyways). Ideally, your application should be making at least 256 bit keys. This is not
594 For a plugin to be compliant it must provide at least each function listed before the accelerators begin. Accelerators are optional,
657 Note that \textit{Twofish} has additional configuration options (Figure \ref{fig:twofishopts}) that take place at build time. These options are found in
730 as there is no more room (it can have 32 ciphers at most) it will return {\bf{-1}}. If you try to add the same cipher more
808 to encrypt whole blocks at a time. However, the library will buffer data allowing the user to encrypt or decrypt partial
834 The ECB and CBC modes process blocks of the same size as the cipher at a time. Therefore, they are less flexible than the
1167 be added at anytime during an EAX stream, and is part of the authentication tag. That is, changes in the meta-data can be detected by changes in the output tag.
1855 You can use the table to indirectly call a hash function that is chosen at run-time. For example:
2019 descriptor must be registered with register\_hash(). At this point the CHC hash cannot be used to hash
2030 be bound to the CHC hash at a time. There are additional requirements for the system to work.
2758 It is possible to be adding entropy and reading from a PRNG at the same time. For example, if you first seed the PRNG
2760 in the PRNG until ready() is called again. This allows the PRNG to be used and re-seeded at the same time. No real error
2876 key, and any hash that produces at least a 256--bit output. However, to make the implementation simpler
2986 This will try to initialize the prng with a state of at least \textit{bits} of entropy. The \textit{callback} parameter works much like
3267 trivial math attacks, and not super slow. The \textit{key} parameter is where the constructed key is placed. All keys must be at
3271 Note: the \textit{rsa\_make\_key()} function allocates memory at run--time when you make the key. Make sure to call
3658 to 4096 bits (512 bytes) which is way more than what is required by ECC. At most, you need 1152 bits to accommodate ECC--521. If you're only using (say)
3953 reduce the bandwidth of the signatures. For example, to have \textit{80-bits of security} with ElGamal, you need a group with an order of at least 1024--bits.
3954 With DSA, you need a group of order at least 160--bits. By comparison, the ElGamal signature would require at least 256 bytes of storage, whereas the DSA signature
3955 would require only at least 40 bytes.
4036 value. For this library they start at $h = 2$ and step until $g$ is not $1$.
4054 at least form a field which is required for the signatures to
4069 and should not be used at all. If the result is $stat = 1$ the DSA key is valid (as far as valid mathematics are concerned).
4417 means you need at least enough memory to keep an additional copy of the output on the heap.
4667 and \textit{child}. The list works as a \textit{doubly-linked list} structure where decoded items at the same level are siblings (using next and prev) and items
4723 At
4739 At this point, \textit{list} will point to the \textit{passwdHash} member of the innermost SEQUENCE. This node has a sibbling, the \textit{pubkey} member of the SEQUENCE.
4746 At this point, we are pointing to the last node of the list. Lists are terminated in all directions by a \textbf{NULL} pointer. All nodes are doubly linked so that you
4899 will not be able to sign or decrypt messages at all. Suppose $p$ was prime and $q$ was composite this is just a variation of
5038 configured. Note that LibTomCrypt can be built with no internal math descriptors. This means that one must be provided at either
5166 In this case, no math descriptors are present in the library and they will have to be made available at build or run time before you can use any of the
5182 that you \textbf{must} specify the \textbf{EXTRALIBS} variable at install time.
5217 At the top of tomcrypt\_custom.h are a series of macros denoted as XMALLOC, XCALLOC, XREALLOC, XFREE, and so on. They resolve to
5263 The simplest precaution is to make sure you process all data in power of two blocks and handle \textit{remainder} at the end. e.g. If you are
5264 CTR'ing a long stream process it in blocks of (say) four kilobytes and handle any remaining incomplete blocks at the end of the stream.
5294 tables at a cost of 4KB of memory. The cipher will be much faster as a result.
5318 Generally the rule of thumb is to setup the tables once at startup and then leave them be. This added build flag simply makes updating
5332 to tell the program which library to use. Only one of the USE flags can be defined at once.
5346 The entire API was designed with plug and play in mind at the low level. That is you can swap out any cipher, hash, PRNG or bignum library and the dependent API will not
5355 At the heart of this flexibility is the \textit{descriptor} system. A descriptor is essentially just a C \textit{struct} which describes the algorithm and provides pointers
5962 but should at least maintain the same level of state entropy.
