[27976] in cryptography@c2.net mail archive
complexity classes and crypto algorithms
daemon@ATHENA.MIT.EDU (Travis H.)
Tue Jun 13 14:57:09 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Tue, 13 Jun 2006 13:09:09 -0500
From: "Travis H." <solinym@gmail.com>
To: Cryptography <cryptography@metzdowd.com>
What kind of problems do people run into when they try to make
cryptographic algorithms that reduce to problems of known complexity?
I'm expecting that the literature is full of such attempts, and one
could probably spend a lifetime reading up on them, but I have other
plans and would appreciate a summary.
In particular, it seems like you should be able to make a respectable
one-way function out of 3SAT.
--
Whom computers would destroy, they must first drive mad.
Security "guru" for rent or hire - http://www.lightconsulting.com/~travis/ -><-
GPG fingerprint: 9D3F 395A DAC5 5CCC 9066 151D 0A6B 4098 0C55 1484
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
