Re: Advice needed - re Disseminating My Crypto Research Work.
- From: gordonb.9w6pz@xxxxxxxxxxx (Gordon Burditt)
- Date: Wed, 26 Nov 2008 13:17:05 -0600
There are five ciphers to hand and each one can be mathematically
demonstrated as having unbreakable security.
1. Is that "unbreakable security" as in "All possible plaintexts
are equally likely and having the ciphertext does not change that"?
(This is true of the one-time pad, and not of other ciphers.)
2. Does this cipher require at least as many true-random bits as
bits of plaintext messages sent over the lifetime of the use
of the cipher?
If your answer to 1 is NO, your cipher is not unbreakable. (Most
every cipher except the one-time-pad falls in this class, like AES,
DES, RSA (even with gigabit keys), etc.)
If your answer to 1 is YES and your answer to 2 is YES, you've
apparently re-invented the one-time-pad, with all the key-management
inconvenience that goes with it.
If your answer to 1 is YES and your answer to 2 is NO, you're
a snake-oil salesman and a liar.
Arguments of the form that "the number of possible keys is SO huge
that you couldn't possibly brute-force it in the lifetime of the
universe" do not imply "unbreakable security".
.
- Follow-Ups:
- Re: Advice needed - Disseminating My Crypto Research Work.
- From: austin . obyrne
- Re: Advice needed - re Disseminating My Crypto Research Work.
- From: Mark Wooding
- Re: Advice needed - Disseminating My Crypto Research Work.
- References:
- Advice needed - re Disseminating My Crypto Research Work.
- From: austin . obyrne
- Advice needed - re Disseminating My Crypto Research Work.
- Prev by Date: Advice needed - re Disseminating My Crypto Research Work.
- Next by Date: Re: Advice needed - re Disseminating My Crypto Research Work.
- Previous by thread: Advice needed - re Disseminating My Crypto Research Work.
- Next by thread: Re: Advice needed - re Disseminating My Crypto Research Work.
- Index(es):
Relevant Pages
|
Loading