Home | History | Annotate | Download | only in libtomcrypt

Lines Matching defs:Since

195 of the ciphers and hashes are patent free or under patents that have since expired.
405 or use one of the provided chaining modes. All of the ciphers are written as ECB interfaces since it allows the rest of
663 speed increase is useful when \textit{TWOFISH\_SMALL} is defined since the s-boxes and MDS multiply form the heart of the
776 This mode is very weak since it allows people to swap blocks and perform replay attacks if the same key is used more
822 My personal preference is for the CTR mode since it has several key benefits:
1163 authentication\footnote{Note that since EAX only requires OMAC and CTR you may use \textit{encrypt only} cipher descriptors with this mode.}.
1440 it is only meant for \textit{packet} mode where the length of the input is known in advance. Since it is a packet mode function, CCM only has one
2764 Below is a simple snippet to read 10 bytes from Yarrow. It is important to note that this snippet is {\bf NOT} secure since
2913 Since SOBER-128 has a fixed keying scheme, and is very fast (faster than RC4) the ideal usage of SOBER-128 is to
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
3236 $1 < M < N-2$ and computes the ciphertext $C = M^e\mbox{ }(\mbox{mod }N)$. Since finding the inverse exponent $d$
3244 The most often suggested value for $e$ is $65537$ since it is large enough to make such attacks impossible and also well
3247 It is important to pad the input to RSA since it has particular mathematical structure. For instance
3266 The \textit{e} parameter is the encryption exponent desired, typical values are 3, 17, 257 and 65537. Stick with 65537 since it is big enough to prevent
3958 Since no useful public standard for DSA key storage was presented to me during the course of this development I made my own ASN.1 SEQUENCE which I document
4399 The length of a SET can be determined by calling der\_length\_sequence() since they have the same encoding length.
4420 Since the decoding of a \textit{SET OF} object is unambiguous it can be decoded with der\_decode\_sequence().
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}.
4809 Where \textit{password} is the users password. Since the algorithm allows binary passwords you must also specify the length in \textit{password\_len}.
4984 The work factor for ECC keys is much higher since the best attack is still fully exponential. Given a key of magnitude
5253 is not \textit{portable} since unaligned accesses are not covered by the ISO C specifications.
5268 data type you can perform integer operations with. Ideally it should be four or eight bytes since it must properly divide the size
5667 Occasionally, a function will want to find a suitable key size to use since the input is oddly sized. The keysize() function is for this case. It accepts a
5691 This function (and the way it's called) differs from the other two since ctr\_encrypt() allows any size input plaintext. The accelerator will only be
6479 Since the function is given the entire RSA key (for private keys only) CRT is possible as prescribed in the PKCS \#1 v2.1 specification.