digit.
I get 2^15 / 2^271 = 1 / 2^256 which is a lot less impressive than your figure
but still a very small probability.
Sincerely,
--
Mathias Brossard
begin:vcard
fn:Mathias Brossard
n:Brossard;Mathias
org:OpenTrust;RD
email;internet:[EMAIL PROTECTED]
title:Senior Architect
x-mozilla-html:FALSE
with URLs like
ftp://ftp.openssl.org/snapshot/openssl-0.9.8-fips-test-SNAP-MMDD.tar.gz
I was wondering if those are snapshots of the future FIPS 1.2 ?
Sincerely,
--
Mathias Brossard
begin:vcard
fn:Mathias Brossard
n:Brossard;Mathias
org:OpenTrust;RD
email;internet:[EMAIL PROTECTED]
title:Senior
).
Sincerely,
--
Mathias Brossard
__
OpenSSL Project http://www.openssl.org
User Support Mailing Listopenssl-users@openssl.org
Automated List Manager [EMAIL
openssl speed rsa...' to see how much CPU is
used. That in turn should tell you if the hardware is actually
offloading the crypto.
Sincerely,
--
Mathias Brossard
__
OpenSSL Project http
proprietary editors: Mocana (http://www.mocana.com/ssl.html), Spyrus
(http://www.spyrus.com/content/products/DeviceSSL_N7.asp), etc...
Sincerely,
--
Mathias Brossard [EMAIL PROTECTED]
__
OpenSSL Project
Sincerely,
--
Mathias Brossard [EMAIL PROTECTED]
__
OpenSSL Project http://www.openssl.org
User Support Mailing List[EMAIL PROTECTED]
Automated List Manager
= sqrt(n) iterate (until it converges):
x[i+1] = (x[i]+n/x[i])/2
Nota:
- You shouldn't use this when doing modular calculus you won't get the
real roots.
- In integer, it will round by truncation.
Sincerely,
--
Mathias Brossard [EMAIL PROTECTED
On Fri, 2003-09-05 at 19:59, Ben Laurie wrote:
Mathias Brossard wrote:
- Asymmetric: DSA, RSA, ECDSA
Not my understanding. Anyway, DSS only. RSA can't be, and ECDSA we
aren't doing.
It's a little disappointing that RSA is not part of the process (it is
much more common than DSA
- Asymmetric: DSA, RSA, ECDSA
- Message Authentication: DES MAC, Triple DES MAC
- Hash: SHA-1
- Keyed Hash: HMAC
- RNG: FIPS 186-2 (Appendix 3.1 3.2), ANSI X9.31 and ANSI X9.62
Sincerely,
--
Mathias Brossard [EMAIL PROTECTED