imate attempts to understand and defeat their software?
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.ciphergoth.org/
-
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
cification of a good way of composing
them. Some commentary by Rogaway can be found here:
http://www.cs.ucdavis.edu/~rogaway/ocb/links.htm
all of his technical commentary seems indisputable, though of course I
would favour choosing less efficient modes over patent-encumbered
modes.
--
__ P
concrete model.
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.ciphergoth.org/
-
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
AARG!Anonymous <[EMAIL PROTECTED]> writes:
> Be sure and send a note to the Gnutella people reminding them of all
> you're doing for them, okay, Lucky?
Do the Gnutella people share your feelings on this matter? I'd be
surprised.
--
__ Paul Crowley
\/ o\ [EMAIL
doesn't compress. I
don't know of any examples which compress and have collision resistance.
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.ciphergoth.org/
-
The Cryptography Mailing List
Unsubscribe
Maybe you can do
something with some sort of idea of "computable distributions" to
overcome the specification problem David Wagner outlines?
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.ciphergoth.org/
-
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
f construction (i.e., 3 rounds of a Feistel cipher), with
> ideal hash functions in each round, does this have the desired properties?
> It might.
This seems to define a block cipher with no key, which is collision
free but not one-way. Am I misunderstanding what you're proposing?
-
transformation.
There's no point as far as security is concerned, I agree - and
usually people are talking about lossy compression, which can only do
harm. The argument seems to be that compression followed by hashing
will be faster than hashing alone, but that seems unikely to me.
--
__
d be as fast as just
feeding the signal straight into SHA-1.
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED] http://www.ciphergoth.org/
/\__/ BiCon 2002 UK bisexual gathering: http://www.2002.bicon.org.uk/
-
The Cryptography Mailing L
te a guide to the explanation in Handbook of Applied Cryptography
which you can find here:
http://www.ciphergoth.org/writing/postings/news-992.txt
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED] http://www.ciphergoth.org/
/\__/ BiCon 2002 UK bisexual gathering:
te in
> > the project.
> >
> > This work potentially has wide application, from hard disk storage
> > to PDAs.
There's some discussion of these issues in the paper presenting my
(broken) block cipher Mercy, which was meant for this application:
http://www.ci
l.com&filter=0
His off-the-cuff estimate of a good new recommended key size was 2048 bits.
It would be good to hear more from other integer factorisation experts.
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED] http://www.ciphergoth.org/
/\__/ BiCon 2002, discount before Apri
the attack can be mounted without the need to seize the secret
keyring.
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.ciphergoth.org/
-
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]
a "spki certs in xml syntax" doc?
The "cache" link on that page carries it:
http://xml.coverpages.org/draft-paajarvi-xml-spki-cert-00.txt
I confess I love SPKI, and I would love to know why we're not in a
sitation where it's in widespread use today.
--
__ Pau
k space and two weeks
preprocessing is sufficient to break A5/1 in about two minutes. Some
known plaintext is needed; I don't know whether anyone's measured how
difficult it is to make guesses at knownn plaintext in a cellphone
voice stream.
--
__ Paul Crowley
\/ o\ [EM
stars, then?" I'm sorry, but I don't know that, either.
http://www.counterpane.com/crypto-gram-0108.html
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.cluefactory.org.uk/paul/
"Conserv
; homepage.
Two of the papers are on my web pages: Scott Fluhrer's on breaking my
cipher Mercy, and Stefan Lucks and mine on breaking Leviathan:
http://www.cluefactory.org.uk/paul/mercy/fluhrer-dc.html
http://www.ciphergoth.org/leviathan
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http:/
the last four digits by trying about a hundred candidates for each
in a birthday attack.
--
__ Paul Crowley
\/ o\ [EMAIL PROTECTED]
/\__/ http://www.cluefactory.org.uk/paul/
"Conservation of angular momentum makes the world go around" - John Clark
18 matches
Mail list logo