[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Applied Cryptography Questions
- To: [email protected]
- Subject: Applied Cryptography Questions
- From: [email protected] (Anonymous)
- Date: Thu, 30 Nov 1995 07:14:49 +0100
- Organization: RePLaY aND CoMPaNY UnLimited
- Sender: [email protected]
- Xcomm: Replay may or may not approve of the content of this posting
- Xcomm: Report misuse of this automated service to <[email protected]>
A couple questions about Applied Cryptography (Second Edition)
1. What on earth is a Neural Net?
2. Consider the Chinese Lottery attack vs a processor bank.
Distributed computing, no easy bombing target.
Need specialized hardware [for speed] or transmission of alogrithms
for any specific alogrithm
Not on all the time
If value(crack) * cracks/chip > cost of chip, then why not have
the gov buy the chips? Its probably cheaper that way.
3. How does one cryptoanalyize a Feistel Network? I've read a bit
on this and it doesn't seem that the papers are consistant,
for example, one claims that 2^32 chosen plaintext is unreasonable
for a 64-bit block cipher whereas DES's cryptanalysis requires
something like 2^42.
4. Does there exist an n such that a keyspace of 2^n is trivial to crack
[ie a matter of miniutes] on a PC but is difficult to crack for a
big commercial company or even a major government? [this question
relates to Merkle's puzzles, when a 40-bit key seems a bit weak.]
5. Is there an errata yet?