hi,
I get the idea,thanx.
Regards Data.
> can u pls explain how they have statistical
> signatures,pls-
>
>
> may be using SPN's, i have tried ANSI X9.17 key
> generation with GOST-it did have a negligably small
> skew-it makes me wonder what statistical signature
> they have.The negligable
hi,
thanx Mr Jim.
Data.
__
Do You Yahoo!?
Yahoo! Autos - Get free new car price quotes
http://autos.yahoo.com
A RNG is a character or string generator whose generation algorithm
prevents prediction of the next output if one knows all the previous
outputs and the algorithm. In other words if you know everything there is
to know about the generator your odds of predicting the next output state
are even - p
hi,
thanx for the replies.
one doubt escpecially on this.
>
>But every algorithm has some
>statistical
>signature and if you've got enough cipher text you
>can compare that
>signature with known algorithms to home in on fewer
>choices.
can u pls explain how they have statistical
signatures,pls-
On Sat, 13 Jul 2002, gfgs pedo wrote:
> can u pls explain how they have statistical
> signatures,pls-
>
>
> may be using SPN's, i have tried ANSI X9.17 key
> generation with GOST-it did have a negligably small
> skew-it makes me wonder what statistical signature
> they have.The negligable skew i
Perhaps a simpler example. Let's look at a 'fair' coin and what that means
in the real world.
A normal coin (or any nDx for that matter [1]) for short sequences is
random. In other words if you record a game sequence and then replay the
game the die sequence won't have any statistical correlatio
On Thu, 11 Jul 2002, Sandy Harris wrote:
> Doing this is only at worst 12 times harder than breaking a
> single known cipher. If some of your 12 breaks are easy, then
> total effort is much less than 12 times the hardest cipher.
> When we're talking about 2^40 steps to break a laughably weak
> ci
Given cipher output with bytes that look uniformly distributed,
it is easy to write a program that will transform the output
to a file having any desired distribution of bytes. I've written
a program that makes the output look like transposition of English
text.
On Thu, 11 Jul 2002, Sandy Harris wrote:
> No. Any good algorithm should produce output that looks /exactly/
> like random noise, hence they should all look like each other.
Wrong, not all RNG's have the same statistical output. There is -nothing-
in the requirement for a RNG that requires it (
On Thu, 11 Jul 2002, Ryan Sorensen wrote:
> Do you have any references for this? A quick google search was less than
> revealing.
There was a discussion (probably several) a few years ago on sci.crypt.
If you point at usenet and try lots of different combinations of keywords
I'm sure you'll find
Mike Rosing wrote:
>
> On Thu, 11 Jul 2002, gfgs pedo wrote:
>
> > suppose a cryptanalysis only has encrypted data-how is
> > going 2 know which is the encrytion algorithm used 2
> > encrypt the data ,so that he can effeciently
> > cryptanalyse if
> >
> > 1:>he has large amount of cipher text on
* Mike Rosing <[EMAIL PROTECTED]> [020711]:
> Depends on how they got the source. They may know it's one of 5
> possible choices because of the person who sent (or received) it.
> If it's just found on a disk in a garbage dump with no connections
> to anyone, it's a bit tougher. But every algori
On Thu, 11 Jul 2002, gfgs pedo wrote:
> suppose a cryptanalysis only has encrypted data-how is
> going 2 know which is the encrytion algorithm used 2
> encrypt the data ,so that he can effeciently
> cryptanalyse if
>
> 1:>he has large amount of cipher text only
> 2:>has large amount of plain text
13 matches
Mail list logo
