Lines Matching refs:more
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
547 because you are to be paranoid. It is because if your PRNG has a bias of any sort the more bits the better. For
730 as there is no more room (it can have 32 ciphers at most) it will return {\bf{-1}}. If you try to add the same cipher more
776 This mode is very weak since it allows people to swap blocks and perform replay attacks if the same key is used more
843 The more sane way to deal with partial blocks is to pad them with zeroes, and then use CBC normally.
2442 routine more efficient but you may pass in any length of text. You can call this function as many times as required to process
2840 descriptor twice, and will return the index of the current placement in the table if the caller attempts to register it more than once. The unregister function
2869 Fortuna is a fast attack tolerant and more thoroughly designed PRNG suitable for long term
2872 providing more security.
2879 Fortuna is more secure than Yarrow in the sense that attackers who learn parts of the entropy being
3268 least 128 bytes, and no more than 512 bytes in size (\textit{that is from 1024 to 4096 bits}).
3640 The optimization works by using a Fixed Point multiplier on any base point you use twice or more in a short period of time. It has a limited size
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
3658 to 4096 bits (512 bytes) which is way more than what is required by ECC. At most, you need 1152 bits to accommodate ECC--521. If you're only using (say)
4006 \textit{group\_size} the more difficult a forgery becomes upto a limit. The value of $group\_size$ is limited by
4768 for completeness. Algorithm Two is a bit more modern and more flexible to work with.
4887 the probability of a pseudo-prime by $1 \over 4$ therefore after sixteen rounds the probability is no more than
5031 each new release that will make the library even more flexible. Each of the classes of functions can be disabled during
5282 Also see technical note number five for more details.
5286 the header file \textit{tomcrypt\_custom.h} for more details. It is meant to provide literally an easy method of trimming the library
5711 While both encrypt and decrypt accelerators are not required it is suggested as it makes lrw\_setiv() more efficient.
6425 All ECC functions must use this mapping system. The only exception is when you remap all ECC callbacks which will allow you to have more control
