Lines Matching refs:Each
124 (and helper API functions) are able to use the new designs automatically. There exists self-check functions for each
459 For each cipher there is a function which will help find a desired key size. It is specified as follows:
594 For a plugin to be compliant it must provide at least each function listed before the accelerators begin. Accelerators are optional,
597 The remaining fields are all pointers to the core functions for each cipher. The end of the cipher\_descriptor array is
786 It is important that the initial vector be unique and preferably random for each message encrypted under the same key.
796 Where $W$ is the size of a block in bits (e.g. 64 for Blowfish). As long as the initial vector is random for each message
875 In each case, \textit{cipher} is the index into the cipher\_descriptor array of the cipher you want to use. The \textit{IV} value is
878 of the cipher you choose. It is important that the IV be random for each unique message you want to encrypt. The
1575 to only use 12--byte IVs. You can just increment it like a counter for each packet.
1647 If you are processing many packets under the same key you shouldn't use this function as it invokes the pre--computation with each call.
3241 Currently RSA is a difficult system to cryptanalyze provided that both primes are large and not close to each other.
3873 recipients multiple call to this function for each public ECC key is required.
4030 Each DSA key is composed of the following variables.
4461 and short integer functions can encode and decode each others outputs.
4502 These will encode or decode an OCTET STRING data type. The octets are stored using one \textbf{unsigned char} each.
4786 The \textit{salt} is a fixed size 8--byte array which should be random for each user and session. The \textit{iteration\_count} is the delay desired
4810 The \textit{salt} is an array of size \textit{salt\_len}. It should be random for each user and session. The \textit{iteration\_count} is the delay desired
4886 composite. No prime number will fail the two phases but composites can. Each round of the Rabin-Miller algorithm reduces
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
5021 thread has its own state variables then they will not affect each other, and are fully thread safe. This is fairly simple with symmetric ciphers
5031 each new release that will make the library even more flexible. Each of the classes of functions can be disabled during
5638 This is a single byte Internal ID you can use to distinguish ciphers from each other.
