> Don Davis <[EMAIL PROTECTED]> writes:
> >perhaps surprisingly, i disagree with the other
> > respondents. as long as you encrypt or MAC the
> > incoming packets (& their interarrival times),
> > with a closely-guarded secret key, before you
> > stuff the bits into your entropy pool, then y
> I should think that the approach taken by generic pharmaceuticals, 'compare
> with Brand X,' would also suffice to get around RSA's trademark issue.
Or, "compatible with brand X" or "interoperates with brand X"..
- Bill
> > Symantec agreed that the program fit its definition of a type of malicious
> > program known as a Trojan horse, so it included the software in its
> > continually updated list of dangerous programs, which include viruses,
> > that cause warnings to pop up on its customers' computers.
>
> In f
A posting by Cindy Cohn, one of Bernstein's legal team, to cyberia-l,
archived at
http://www.ljx.com/mailinglists/cyberia-l/20266.html
suggests that it would be premature to create such sites.
She writes:
First, the decision is not final for at least 52 days (45 for the
govt to see
[CC's to lists I'm not on trimmed; feel free to forward this as long
as you CC: me on forwards..]
Peter Junger has a list specifically for discussing the
source-code-as-speech issue; for more info on the list, see
http://samsara.law.cwru.edu/~sftspch/
The fact that source code is an e
If readability of code doesn't matter, why have I seen so much angst
within communities of developers indentation styles, identifier
spelling, and line breaks? None of them make a bit of difference in
the generated object code..
I think Sturgeon's Law may apply here: "90% of everything is crap".
[CC:'s to list I don't subscribe to deleted.]
one possible escape clause here is a constitutional provision
regarding immunity of legislators for acts in congress:
[from article 1, section 6]
".. for any Speech or Debate in either House, they shall not be
questioned in any other place."
.. so,
> There are no Turing machines. Real computers are finite, and real
> source codes are finite. I'm sure that if you set a limit on the
> length of the source code which is recognized by the supposed trap, a
> sufficiently large FSM can decide in a finite time whether there's a
> trap.
mere fini
Someone told me that the cipher and integrity protection algorithms
proposed for use in the next generation mobile phone networks are now
publicy available on the etsi website:
http://www.etsi.org/dvbandca/3GPP-ALGORITHMS/
Don't shoot the messenger, I don't have anything to do with this
stuff.
