Lines Matching refs:Work
144 {\bf own} crypto library and hopefully along the way others will appreciate the work.
153 Not only did I strive to make a consistent and simple API to work with but I also attempted to make the library
155 without having to use configure scripts. This means that the library will work with platforms where development
396 work properly on platforms where an \textit{unsigned char} is not eight bits.
686 To work with the cipher\_descriptor array there is a function:
1144 These work with the current IV value only and not the encrypted IV value specified during the call to f8\_start(). The purpose of these two functions is to be
1976 work exactly like those of the cipher registration code. The functions are:
2030 be bound to the CHC hash at a time. There are additional requirements for the system to work.
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
2831 Just like the ciphers and hashes, you must register your prng before you can use it. The two functions provided work exactly as those for the cipher registry functions.
2871 to work with most cipher and hash combos based on which you have chosen to build into the library.} while
2875 and SHA--256 hash function. Technically, Fortuna will work with any block cipher that accepts a 256--bit
2976 used when the slower ANSI C RNG must be used so the calling application can still work. This is useful since the ANSI C RNG has a throughput of roughly three
2988 platform where the RNG does not work well. Example usage of this function is given below:
3220 It's important to use the same \textit{saltlen} and hash for both encoding and decoding as otherwise the procedure will not work.
3282 To do raw work with the RSA function, that is without padding, use the following function:
3296 Note: the output of this function is zero--padded as per PKCS \#1 specification. This allows this routine to work with PKCS \#1 padding functions properly.
3606 192-bit key) then the work factor is $2^{96}$ in order to find the secret key.
3944 With ECC if you try to sign a hash that is bigger than your ECC key you can run into problems. The math will still work, and in effect the signature will still
3945 work. With ECC keys the strength of the signature is limited by the size of the hash, or the size of they key, whichever is smaller. For example, if you sign with
3993 and easy to work with.
4768 for completeness. Algorithm Two is a bit more modern and more flexible to work with.
4893 math operations. As a result the routine can scan ahead to the next number required for testing with very little work
4940 typos can cause algorithms to fail to work as desired.
4958 The following chart gives the work factor for solving a DH/RSA public key using the NFS. The work factor for a key of order
4964 Note that $n$ is not the bit-length but the magnitude. For example, for a 1024-bit key $n = 2^{1024}$. The work required
4969 \hline RSA/DH Key Size (bits) & Work Factor ($log_2$) \\
4984 The work factor for ECC keys is much higher since the best attack is still fully exponential. Given a key of magnitude
4985 $n$ it requires $\sqrt n$ work. The following table summarizes the work required:
4989 \hline ECC Key Size (bits) & Work Factor ($log_2$) \\
5208 which will work on all platforms.
5296 When TWOFISH\_TABLES is defined the cipher will use pre-computed (and fixed in code) tables required to work. This is
5298 will increase by approximately 500 bytes. If this is defined but TWOFISH\_SMALL is not the cipher will still work but
5356 to functions that do the required work. For a given class of operation (e.g. cipher, hash, prng, bignum) the functions of a descriptor have identical prototypes which makes
5719 This function is meant for accelerated CCM encryption or decryption. It processes the entire packet in one call. You can optimize the work flow somewhat
6296 (can be ignored if you work in affine only)
6400 All functions except the Montgomery reductions work from left to right with the arguments. For example, mul(a, b, c) computes $c \leftarrow ab$.
6409 The ECC system in LibTomCrypt is based off of the NIST recommended curves over $GF(p)$ and is used to implement EC-DSA and EC-DH. The ECC functions work with
