Re: what is Perfect Secrecy of One-time-pad
- From: Einstein <michaelhh@xxxxxxxxx>
- Date: Fri, 09 Nov 2007 05:58:53 -0000
Ok a simple method to determine the truth
There is 26 letters, space, comma, 10 numbers, and a few 'other' types
of text used. Let us say that there is 16 characters instead replacing
the usual characters on your keyboard (Typically 8 bit keyboard if my
understanding is correct).
lets say 1/4 are extremely common in real text. That 1/4 is unusual in
real text, and that the remaining 1/2 ranges from extremely uncommon
to not at all.
Now we have this table
1 = 0.15
2 = 0.15
3 = 0.15
4 = 0.15
5 = 0.06
6 = 0.06
7 = 0.06
8 = 0.06
9 = 0.03
10 = 0.03
11 = 0.03
12 = 0.03
13 = 0.01
14 = 0.01
15 = 0.01
16 = 0.01
Normally any one digit has 1/16 (0.0625) chance of statistically
occurring. However random being random we can see a deviance of up to .
5 down to say .001. And this would not be outside 'the pattern' of
random chance. Now using copies of previous writing for references we
could in theory mount an attack, if we saw severe deviances, based
upon a "normal brute force all possibilities" outcome with leeway for
obvious deviances. However I would note that a deviancy on one
character does not necessarily mean the other characters are
'translatable' easier. In fact a severe deviance makes it harder to
know the rest. So in this case we have 1 out of whack, and 15 that
could be just random chance. So while we could try to do our attack,
we would still have to run the vast majority of possible methods and
if it really is text, with words, translate out the most appropriate
outcome. Even with 2 or 3 being obviously out of line we still have
the vast majority which are then in proper valuations.
Try your mathematical sequences and all that crap... If it cant pass a
simple BY HAND effort, with a lot of tries no less, then it is no
good. My math in school had no usage of any extra crap... just the
answers... because I see math when it is complete. When complete this
math does not make it exceptionally easier at all... Just a small
intsy bitsy bit more easier. Even that is easily subjected to
encryption to prevent it...
.
- Follow-Ups:
- Re: what is Perfect Secrecy of One-time-pad
- From: wangyong
- Re: what is Perfect Secrecy of One-time-pad
- References:
- Re: Analyses of Mistake on Proof about Perfect Secrecy of One-time-pad
- From: wangyong
- Re: Analyses of Mistake on Proof about Perfect Secrecy of One-time-pad
- From: Quadibloc
- Re: Analyses of Mistake on Proof about Perfect Secrecy of One-time-pad
- From: wangyong
- what is Perfect Secrecy of One-time-pad
- From: biject
- Re: what is Perfect Secrecy of One-time-pad
- From: Quadibloc
- Re: Analyses of Mistake on Proof about Perfect Secrecy of One-time-pad
- Prev by Date: Re: May I ask the 'spammer' what his/her desire to prove is?
- Next by Date: Re: Analyses of Mistake on Proof about Perfect Secrecy of One-time-pad
- Previous by thread: Re: what is Perfect Secrecy of One-time-pad
- Next by thread: Re: what is Perfect Secrecy of One-time-pad
- Index(es):
Loading