Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad

From: wangyong <hellowy@xxxxxxx>
Date: Sun, 28 Oct 2007 07:50:30 -0700

When only considering C=0 and the cryptosystem
(regardless of the prior probability of plaintext),
we can educe that the plaintexts are equally likely

Are you now admitting this statement is false?

================================When only considering C=0 and the
cryptosystem
(regardless of the prior probability of plaintext),

can you see the precondition?

.

Follow-Ups:
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: William Hughes

References:
- Confirmation of Shannon’s Mistake about Perfect Secrecy of One-time-pad
  - From: wangyong
- Re: Confirmation of Shannon’s Mistake about Perfect Secrecy of One-time-pad
  - From: William Hughes
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: wangyong
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: William Hughes
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: wangyong
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: William Hughes
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: wangyong
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: William Hughes
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: wangyong
- Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
  - From: William Hughes

Prev by Date: Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
Next by Date: Re: is it a measure?
Previous by thread: Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
Next by thread: Re: Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad
Index(es):
- Date
- Thread

Relevant Pages

Re: Confirmation of Shannons Mistake about Perfect Secrecy of One-time-pad
... (regardless of the prior probability of plaintext), ... you cannot "educe that the plaintexts ...
(sci.math)
Re: Confirmation of Shannons Mistake about Perfect Secrecy of One-time-pad
... (regardless of the prior probability of plaintext), ...
(sci.math)
Cryptography FAQ (03/10: Basic Cryptology)
... Plaintext? ... How does one go about cryptanalysis? ... What are some properties satisfied by every strong cryptosystem? ... A strong cryptosystem will resist all known previous attacks. ...
(sci.crypt)
Cryptography FAQ (03/10: Basic Cryptology)
... Plaintext? ... How does one go about cryptanalysis? ... What are some properties satisfied by every strong cryptosystem? ... A strong cryptosystem will resist all known previous attacks. ...
(sci.crypt)
Cryptography FAQ (03/10: Basic Cryptology)
... Plaintext? ... How does one go about cryptanalysis? ... What are some properties satisfied by every strong cryptosystem? ... A strong cryptosystem will resist all known previous attacks. ...
(sci.crypt)