Lines Matching refs:Example
171 For example, consider a hardware platform with a specialized RNG device. Obviously one would like to tap
236 An example of handling an error is:
319 Certain functions such as (for example) \textit{rsa\_export()} give an output that is variable length. To prevent buffer overflows you
320 must pass it the length of the buffer where the output will be stored. For example:
351 In the above example if the size of the RSA public key was more than 1024 bytes this function would return an error code
363 Certain PRNG algorithms do not require a \textit{prng\_state} argument (sprng for example). The \textit{prng\_state} argument
394 lower eight bits contain data. For example, if you want to pass a 256 bit key to a symmetric ciphers setup routine, you
425 that you should only used this scheduled key with the intended cipher. For example, if you call \textit{blowfish\_setup()} do not
465 will return {\bf CRYPT\_OK} if the key size specified is acceptable. For example:
496 An example snippet that encodes a block with Blowfish in ECB mode.
548 example, if you have $\mbox{Pr}\left[X = 1\right] = {1 \over 2} \pm \gamma$ where $\vert \gamma \vert > 0$ then the
692 the location in the array where the cipher was found. For example, to indirectly setup Blowfish you can also use:
1266 "TestApp", /* example header */
1484 \subsubsection{CCM Example}
1649 \subsubsection{Example Usage}
1650 The following is an example usage of how to use GCM over multiple packets with a shared secret key.
1765 are buffered. The data can be passed in any sized chunks as long as the order of the bytes are the same the message digest (hash output) will be the same. For example,
1793 example snippet that hashes a message with md5 is given below.
1855 You can use the table to indirectly call a hash function that is chosen at run-time. For example:
2037 Example of using CHC with the AES block cipher.
2148 Which returns {\bf CRYPT\_OK} if the code passes otherwise it returns an error code. Some example code for using the
2225 function succeeds. The function is not sensitive to the granularity of the data. For example,
2286 Which returns {\bf CRYPT\_OK} if the code passes otherwise it returns an error code. Some example code for using the
2362 data. For example,
2451 \subsection{Example}
2758 It is possible to be adding entropy and reading from a PRNG at the same time. For example, if you first seed the PRNG
2763 \subsection{Example}
2917 \subsubsection{Example Usage}
2988 platform where the RNG does not work well. Example usage of this function is given below:
3026 requires to be started, that is you need not call the start, add\_entropy, or ready functions. For example, consider
3027 the previous example using this PRNG.
3140 $m - 2h - 2$. For example, with a $1024$--bit RSA key and SHA--1 as the hash the maximum payload is $86$ bytes.
3242 Ideally $e$ should be larger than $100$ to prevent direct analysis. For example, if $e$ is three and you do not pad
3489 \mysection{RSA Encryption Example}
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
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
3953 reduce the bandwidth of the signatures. For example, to have \textit{80-bits of security} with ElGamal, you need a group with an order of at least 1024--bits.
4197 It will assign to the \textit{index}th position in the \textit{list} the triplet (Type, Data, Size). An example usage would be:
4354 This example encodes a SEQUENCE with two IA5 STRING types containing ``Hello'' and `` World!'' respectively. Note the usage of the \textbf{UL} modifier
4947 having to hack the library. For example, suppose you have a hardware specific PRNG on your system. You could easily
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
5050 Changing MAKE allows you to change what program will be invoked to handle sub--directories. For example, this
5669 example, if the input is $25$ and $24$ is valid then it stores $24$ back in the pointed to integer. It must not round up and must return an error if the keysize
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$.
6476 to the \textit{out} buffer. The output must be zero padded (leading bytes) so that the length of the output matches the length of the modulus (in bytes). For example,
