also sprach martin f krafft [EMAIL PROTECTED] [2005.05.16.1924 +0200]:
Interesting... this is not how I remembered it.
... I had been subscribed to the moderated minder.net list in the
past... this explains :)
Again, sorry, also for the noise.
--
martin; (greetings from the heart
also sprach Eugen Leitl [EMAIL PROTECTED] [2003.10.09.1129 +0200]:
Are there technical reasons for this situation? If yes, what is
required to enable IPsec default interoperability at least with
open source OSses?
A curious idea that I've been paying some attention to for a while.
One could
also sprach Eugen Leitl [EMAIL PROTECTED] [2003.10.09.1931 +0200]:
What is wrong which just exchanging the keys for ad hoc mode? You could
cache
them and log whenever a key has changed (at least allowing to detect a MITM
post facto).
.. like SSH, huh?
We're really looking for blanket rollout
also sprach Roy M. Silvernail [EMAIL PROTECTED] [2003.09.20.1951 +0200]:
slashdot
You're new here, aren't you?
/slashdot
Not at all, I just never came across this discussion. I have pretty
strong filters on cypherpunks, letting through only new threads and
replies to threads that interest me.
also sprach Jim Choate [EMAIL PROTECTED] [2003.09.20.1638 +0200]:
http://www.theregister.co.uk/content/6/32936.html
Don't want to open a can of worms here, but is cypherpunks secondary
function to be Jim's link distribution list? I mean, we all know The
Register and we all look around.
--
also sprach Sarad AV [EMAIL PROTECTED] [2003.08.17.1219 +0200]:
Okay- I need 5 bits to represent 32 coins.I count as
coin 0,coin 1,... coin 31.
No, you can't count coin 0. Or how will you represent no coins?
I would appreciate if you wouldn't simply include the quoted message
in your reply.
also sprach Sarad AV [EMAIL PROTECTED] [2003.08.16.1321 +0200]:
f(x)=2x for all x=0,1,2,... ;
f(x)=2x+1 for all x=0,1,2,...;
You need an extra bit to store which of the two is used. Otherwise,
f(x)=2x
=2*5
=10for x=5;
Decimal number 5 can be represented in binary as 101.
... you
