-)
Regards,
Bernard
>
> Hazel
> >
> >
> > Does anyone have the URL for how Netsape and/or MSIE validate or
> > test then accept a CA for inclusion in their web browsers?
> >
Bernard Dautrevaux
Microprocess In
tures I use; if you wish to continue
using this service you must answer YES at the following dialog"
Then downloads a self-signed certificate... :-( I bet a lot of people, even
moderately aware of what security means, will accept this (especially if it
was better worded :-)) and thus allo
ed with
the other parties if needed, and may be the other party itself (if signing a
simple bilateral contract).
My question is thus: is there such a protocol, and such timestampting
authorities? This role could be assumed by the root CAs or by official time
holding bodies; note that this only need
eeding a PRNG to obtain unrelated
sequences (as needed when using montecarlo techniques fro statistical
analysis) and when one need to obtain UNPREDICTABLE sequences. Here we're
talking of the second case; your approach may be valid for the first case
but not at all for cryptographic activities.
HTH
e rest we had to convert all the test scripts in C programs
(we do not have a bourne shell on the target) and are running (successfully
for now) the tests.
Bernard
Bernard Dautrevaux
Microprocess Ingéniérie
97 bis, rue de Colombes
92400 C
t from
http://www.wxwindows.org).
HTH
Bernard
Bernard Dautrevaux
Microprocess Ingenierie
97 bis, rue de Colombes
92400 COURBEVOIE
FRANCE
Tel:+33 (0) 1 47 68 80 80
Fax:+33 (0) 1 47 88 97 85
e-m
ernard
PS: Although always attracting people, I'm not sure this GPL-compatibility
issue should be discussed at length once more. Perhaps a entry in a FAQ
could just summarize the issue (with mention of the definitive and
authoritative optinion of RMS) with indication to people willing to relea
t it?
Regards,
Bernard
PS: and please excuse me, but I really can't look at this myself due to
(maily) lack of time ;-(
Bernard Dautrevaux
Microprocess Ingenierie
97 bis, rue de Colombes
92400 COURBEVOIE
FRANCE
Tel:+33 (0
to each of the documents. Of course, in
> actual applications those assumptions are often not met; but
> simply assuming that colliding pairs of valid documents are
> much harder to find than other collisions is a mistake.
Especially as this is simpler and simpler as computer are fas
> -Original Message-
> From: Eric Rescorla [mailto:[EMAIL PROTECTED]]
> Sent: Friday, December 07, 2001 5:29 PM
> To: [EMAIL PROTECTED]
> Subject: Re: Cryptology Questions
>
>
> Bernard Dautrevaux <[EMAIL PROTECTED]> writes:
> > It's even worst t
o send "me too"s, but this all mess makes the list
totally unusable for me! ;-(
Bernard
Bernard Dautrevaux
Microprocess Ingenierie
97 bis, rue de Colombes
11 matches
Mail list logo
