[122540] in cryptography@c2.net mail archive
Re: [mm] OpenSparc -- the open source chip (except for the crypto
daemon@ATHENA.MIT.EDU (Ben Laurie)
Mon May 5 19:58:03 2008
Date: Mon, 05 May 2008 13:50:12 +0100
From: Ben Laurie <ben@links.org>
To: "Perry E. Metzger" <perry@piermont.com>
CC: Marcos el Ruptor <ruptor@cryptolib.com>,
Cryptography <cryptography@metzdowd.com>
In-Reply-To: <87d4o0ncoz.fsf@snark.cb.piermont.com>
Perry E. Metzger wrote:
> Ben Laurie <ben@links.org> writes:
>> I think that's blatantly untrue. For example, if I look at an AND
>> gate, I can be absolutely sure about its security properties.
>
> An AND gate isn't Turing Equivalent.
Nor are most algorithms.
>> Rice's theorem says you can't _always_ solve this problem. It says
>> nothing about figuring out special cases.
>
> Any modern processor is sufficiently larger than an AND gate that it
> is no longer tractable. It isn't even possible to describe the
> security properties one would need to (formally) prove.
I won't debate that, but its not a consequence of Rice's Theorem.
--
http://www.apache-ssl.org/ben.html http://www.links.org/
"There is no limit to what a man can do or how far he can go if he
doesn't mind who gets the credit." - Robert Woodruff
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
