Lines Matching defs:memory
410 have the same prototype and store their keys as naturally as possible. This also removes the need for dynamic memory
426 pass the scheduled key onto \textit{rc5\_ecb\_encrypt()}. All built--in setup functions do not allocate memory off the heap so
671 \hline \textbf{TWOFISH\_SMALL} & \textbf{TWOFISH\_TABLES} & \textbf{Speed and Memory (per key)} \\
832 block of memory with either of the three modes.
1209 \textit{ct}. Note: \textit{ct} and \textit{pt} may be the same region in memory. This function will also send the ciphertext
1211 \textit{pt} and \textit{ct} to be the same region in memory.
1298 You can also perform an entire EAX state on a block of memory in a single function call with the
1366 states (with different nonces). Also \textit{pt} and \textit{ct} may point to the same location in memory.
1407 To make life simpler the following two functions are provided for memory bound OCB.
2116 message (file pointer, address in memory), and produce the HMAC result in one shot. These are useful if you want to avoid
2252 Similar to the HMAC code the file and memory functions are also provided. To OMAC a buffer of memory
2386 Similar to the OMAC code the file and memory functions are also provided. To PMAC a buffer of memory in one shot use the
2538 Helper functions are provided to make parsing memory buffers and files easier. The following functions are provided:
2624 Helper functions are provided to make parsing memory buffers and files easier. The following functions are provided:
2702 This will terminate a PRNG state and free any memory (if any) allocated. To export a PRNG state
2739 flash memory, etc). The next time your application starts up you can detect the state, feed it to the
3271 Note: the \textit{rsa\_make\_key()} function allocates memory at run--time when you make the key. Make sure to call
3273 free the memory allocated.
3592 This will import the key stored in \textit{inlen} and import it to \textit{key}. If the function fails it will automatically free any allocated memory. This
3646 The optimization uses a window on the multiplicand of FP\_LUT bits (default: 8, min: 2, max: 12), and this controls the memory/time trade-off. The larger the
3647 value the faster the algorithm will be but the more memory it will take. The memory usage is $3 \cdot 2^{FP\_LUT}$ integers which by default
3648 with TFM amounts to about 400kB of memory. Tuning TFM (by changing FP\_SIZE) can decrease the usage by a fair amount. Memory is only used by a cache entry
3659 ECC--256 you will only need 576 bits, which would reduce the memory usage by 700\%.
3758 To free the memory allocated by a ecc\_make\_key(), ecc\_make\_key\_ex(), ecc\_import(), or ecc\_import\_ex() call use the following function:
3784 any allocated memory automatically.
3798 all internally allocated memory upon error.
3822 \textit{key}. The function will free any allocated memory upon error.
3835 The imported key is stored in the ECC key pointed to by \textit{key}. The function will free any allocated memory upon error.
4023 When you are finished with a DSA key you can call the following function to free the memory used.
4417 means you need at least enough memory to keep an additional copy of the output on the heap.
4681 all required memory for the decoding. It stores the number of octets read back into \textit{inlen}.
4686 An invalid decoding will terminate the process, and free the allocated memory automatically.
4761 This will free all of the memory allocated by der\_decode\_sequence\_flexi().
5215 \subsection{X memory routines}
5218 the name of the respective functions from the standard C library by default. This lets you substitute in your own memory routines.
5236 Assumes that you have no memory paging with the stack.
5251 This mode does have one downside. It can cause unaligned reads from memory if you are not careful with the functions. This is why
5258 ctr\_start() and all the inputs you gave are aligned than ctr\_encrypt() will perform aligned memory operations only. However, if you
5292 requires only 200 bytes of memory. This is achieved by not pre-computing the substitution boxes. Having this
5294 tables at a cost of 4KB of memory. The cipher will be much faster as a result.
5656 ones provided. Just make sure in your \textit{done()} function that you free the allocated memory.
6264 /** clean up (frees memory)
