Lines Matching refs:routines
121 public key cryptography (via PKCS \#1 RSA, DH or ECCDH), and a plethora of support routines.
166 pseudo--random number generators (PRNG), and bignum math routines are all used within the API through \textit{descriptor} tables which
173 is write a descriptor and the few support routines required for the device. After that the rest of the
179 unlike libraries like OpenSSL is not tied to direct routines. For instance, in OpenSSL there are CBC block
180 mode routines for every single cipher. That means every time you add or remove a cipher from the library
183 the key setup, ECB decrypt and encrypt and test vector routines. After that all five chaining mode routines
395 must pass in (a pointer to) an array of 32 \textit{unsigned char} variables. Certain routines (such as SAFER+) take
560 To facilitate automatic routines an array of cipher descriptors is provided in the array \textit{cipher\_descriptor}. An element
830 The CTR, CFB and OFB routines provided allow you to encrypt block sizes that differ from the ciphers block size. They
848 The library provides simple support routines for handling CBC, CTR, CFB, OFB and ECB encoded messages. Assuming the mode
850 use that mode. They have identical setup routines (except CTR and ECB mode):
889 The routines return {\bf CRYPT\_OK} if the cipher initialized correctly, otherwise, they return an error code.
892 To actually encrypt or decrypt the following routines are provided:
2102 number of octets to process. Like the hash process routines you can send the data in arbitrarily sized chunks. When you
2202 CMAC within NIST, for the purposes of this library OMAC and CMAC are synonymous. From an API standpoint, the OMAC routines work much like the
2203 HMAC routines. Instead, in this case a cipher is used instead of a hash.
3255 For RSA routines a single \textit{rsa\_key} structure is used. To make a new RSA key call:
3603 Diffie-Hellman routines in the previous chapter. Elliptic curves (of certain forms) have the benefit that they are harder
4949 need a PRNG can instantly take advantage of it. The same applies for ciphers, hashes, and bignum math routines.
5026 pthreads based mutex locking in various routines such as the Yarrow and Fortuna PRNGs, the fixed point ECC multiplier, and other routines.
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.
5225 \subsection{X clock routines}
5240 If LTC\_NO\_TEST has been defined, the testing routines will be compacted and only return CRYPT\_NOP.
5247 This mode (auto-detected with x86\_32,x86\_64 platforms with GCC or MSVC) configures various routines such as ctr\_encrypt() or
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
5352 portable routines. For instance, hand optimized assembler versions of AES could be provided. Any existing function that uses the cipher could automatically use
5357 development simple. In most dependent routines all an end developer has to do is register\_XXX() the descriptor and they are set.
5674 it is not supported. In those cases the software defaults are used (using the single ECB block routines).
6404 The digit routines (including functions with the \textit{i} suffix) use a \textit{unsigned long} to represent the digit. If your internal digit is larger than this you must
