Lines Matching defs:Algorithm
2201 algorithm which produces a Message Authentication Code (MAC) using only a block cipher such as AES. Note: OMAC has been standardized as
2213 The \textit{omac} parameter is the state for the OMAC algorithm. The \textit{cipher} parameter is the index into the cipher\_descriptor table
2217 To send data through the algorithm call
2338 protocol is another MAC algorithm that relies solely on a symmetric-key block cipher. It uses essentially the same
2906 Unlike Yarrow and Fortuna, all of the entropy (and hence security) of this algorithm rests in the data
3225 RSA is a public key algorithm that is based on the inability to find the \textit{e-th} root modulo a composite of unknown
3642 pre--computation phase, and then the fixed point algorithm can be used. For example, if you use a NIST base point twice in a row, the 2$^{nd}$ and
3643 all subsequent point multiplications with that point will use the faster algorithm.
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
3869 hash algorithm indexed by \textit{hash} to construct a shared secret which may be XOR'ed against the plaintext. The ciphertext is stored in
3903 There are also functions to sign and verify messages. They use the ANSI X9.62 EC-DSA algorithm to generate and verify signatures in the
3950 \chapter{Digital Signature Algorithm}
3952 The Digital Signature Algorithm (or DSA) is a variant of the ElGamal Signature scheme which has been modified to
4108 the ECC encryption format to the DSA algorithm.
4767 is made up of two algorithms, Algorithm One and Algorithm Two. Algorithm One is the older fairly limited algorithm which has been implemented
4768 for completeness. Algorithm Two is a bit more modern and more flexible to work with.
4770 \subsection{Algorithm One}
4771 Algorithm One accepts as input a password, an 8--byte salt, and an iteration counter. The iteration counter is meant to act as delay for
4772 people trying to brute force guess the password. The higher the iteration counter the longer the delay. This algorithm also requires a hash
4773 algorithm and produces an output no longer than the output of the hash.
4785 Where \textit{password} is the user's password. Since the algorithm allows binary passwords you must also specify the length in \textit{password\_len}.
4792 \subsection{Algorithm Two}
4794 Algorithm Two is the recommended algorithm for this task. It allows variable length salts, and can produce outputs larger than the
4796 from a single password and invocation of this algorithm.
4809 Where \textit{password} is the users password. Since the algorithm allows binary passwords you must also specify the length in \textit{password\_len}.
4830 /* create the material (100 iterations in algorithm) */
4885 Rabin-Miller primality testing algorithm. If the candidate passes both phases it is declared prime otherwise it is declared
4886 composite. No prime number will fail the two phases but composites can. Each round of the Rabin-Miller algorithm reduces
4896 In the event that a composite did make it through it would most likely cause the the algorithm trying to use it to fail. For
4944 before you try to use them. This includes any function which would use an algorithm indirectly through a descriptor table.
5323 algorithm which prevents leaking key bits of the private key (scalar). It is a slower algorithm but useful for situations
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
5845 This processes message bytes. The algorithm must accept any length of input that the hash would allow. The input is not
