r OpenSSL equivalents as I
run into them, but it seems it should be possible to do something
more general.
Chris Dodd
d...@csl.sri.com
__
OpenSSL Project http://w
ttack, its clear
that using 112 bits of entropy to generate an RSA key (of any length)
cannot possibly give you more that 56 bits of security, and probably
far less.
Chris Dodd
d...@csl.sri.com
__
OpenS
Roughly keysize - paddingsize is the limit. keysize in your case is 512
bytes and padding size for OAEP padding (the common standard) is ~41, so
the limit is about 471 bytes.
Usually when encrypting a file, you use a symmetric cipher with a
randomly chosen key, and then encrypt the key with R
On Fri, Jun 24, 2011, Yan, Bob wrote:
Hi,
I have used IBM purify to check my test program which invokes openssl
library. There are some memory leaks reported by Purify, please see
below. Could somebody point to me from which function those leaks were
generated, and how to avoid those leak
x and
wrapping a mutex acquire around every call into the library. Is
this kind of locking expected to be needed?
Chris Dodd
cd...@csl.sri.com
__
OpenSSL Project http://www.openssl.org
User Support Ma