sci.crypt
  Home FAQ Contact Sign in
sci.crypt only
 
Advanced search
December 2006
motuwethfrsasuw
    123 48
45678910 49
11121314151617 50
18192021222324 51
25262728293031 52
2006
 Jan   Feb   Mar   Apr 
 May   Jun   Jul   Aug 
 Sep   Oct   Nov   Dec 
2008 2007 2006  
total
sci.crypt Profile…
RELATED GROUPS

POPULAR GROUPS

 Up
  Re: what is probability to create two equal hashes for md5 algorithm         


Author: Luc The Perverse
Date: Dec 5, 2006 18:14

"Mike Amling" allspam.com> wrote in message
news:el55do$3rn@dispatch.concentric.net...
> Unruh wrote:
>> Mike Amling allspam.com> writes:
>>
>>> Dmitry Chumack wrote:
>>>> Hi *
>>>>
>>>> I have a question. There is few doesns of __terabytes__ of data. I need
>>>> to split this data to blocks of fixed size. Than I need to calculate a
>>>> sha1 hash for each block and store it. The question is which minimal
>>>> size of block I have to choose to minimize the probability of existence
>>>> of two equal hashes? What probability of such a coincidence would be if
>>>> I'll use an md5, crc32 or sha2 algorithms instead of sha1? Or if I'll
>>>> use a combination of this algorithms (e.g. sha1 and crc32 or sha2 and
>>>> md5 and crc32)?
>>
>> Unless the block size is less than 16 bytes do not worry about
>> collisions. (If it is less than 16 bytes you will get collisions because
>> the two blocks ...
Show full article (1.38Kb)
no comments
  Re: what is probability to create two equal hashes for md5 algorithm         


Author: Unruh
Date: Dec 5, 2006 13:23

Mike Amling allspam.com> writes:
>Dmitry Chumack wrote:
>> Hi *
>>
>> I have a question. There is few doesns of __terabytes__ of data. I need
>> to split this data to blocks of fixed size. Than I need to calculate a
>> sha1 hash for each block and store it. The question is which minimal
>> size of block I have to choose to minimize the probability of existence
>> of two equal hashes? What probability of such a coincidence would be if
>> I'll use an md5, crc32 or sha2 algorithms instead of sha1? Or if I'll
>> use a combination of this algorithms (e.g. sha1 and crc32 or sha2 and
>> md5 and crc32)?

Unless the block size is less than 16 bytes do not worry about collisions.
(If it is less than 16 bytes you will get collisions because the two blocks
are identical)
> If you use SHA-1, you won't have any collisions. If you use MD5, you
>won't have any collisions unless the data has been specially constructed
>to produce a collision.
>--Mike Amling
1 Comment
  Re: RSACryptoServiceProvider or similar         


Author: Mike Amling
Date: Dec 5, 2006 12:06

hula wrote:
> Mike Amling schrieb:
>
>>> http://csrc.nist.gov/publications/fips/fips186-2/fips186-2-change1.pdf.
>>> As for pre-built implementations, try searching for crypto library c++,
>>> and look for DSS or DSA.
>>> Other digital signature protocols include ECDSA and RSA-PSS.
>> Note: I suggest RSA-PSS with exponent 3 when the application needs a
>> digital signature that can be verified quickly.
>>
>> --Mike Amling
>
> I'm using a DSA key to sign the data now (also including the keypair)
> and also base64 encodung the data after, so its not readable.
>
> Think this should be sufficient. And if someone is able to break the
> key ... he will also be able to remove the liciencing think kompletply
> from the app :)
>
> And best: Its all build in the DotNet framework 2.0 ...
Show full article (0.91Kb)
no comments
  Storing data         


Author: hula
Date: Dec 5, 2006 10:46

Hello all

can someone tell me if there's a possibility to save some data/flag on
a win2k/xp machine thats not that easy to track?

I mean saving some data to a file you can use FileMon or a registry
RegMon to check if an app accesses them.

What i need is some stored flag if an application was allready
installed (or allready started) once befor.

many thanks in advance

PS: i know this is probably not the right forum, but as i allready got
some good info here i'll give it a try :)
10 Comments
  what is probability to create two equal hashes for md5 algorithm         


Author: Dmitry Chumack
Date: Dec 5, 2006 09:18

Hi *

I have a question. There is few doesns of __terabytes__ of data. I need
to split this data to blocks of fixed size. Than I need to calculate a
sha1 hash for each block and store it. The question is which minimal
size of block I have to choose to minimize the probability of existence
of two equal hashes? What probability of such a coincidence would be if
I'll use an md5, crc32 or sha2 algorithms instead of sha1? Or if I'll
use a combination of this algorithms (e.g. sha1 and crc32 or sha2 and
md5 and crc32)?

Thanks in advance.
38 Comments
  Re: Cryptography in the UK...         


Author: Unruh
Date: Dec 5, 2006 09:16

Thad Mulligan use.net> writes:
>Are you so lame that you actually fear the government?

Anyone who does not fear a stronger opponent is an idiot.
>Fuck politicians, police, and all others who attempt to control
>crypto.

Rape is also a crime. I am sure it would not be consentual.
>Cryptography protects our rights of privacy and those who cowtow to
>the pigs are not cryptographers at all. They are nothing more than
>crypto-narcs.
>Citizens of Iran, Iraq, North Korea, or anywhere can get a copy of PGP
>easily. Use BitTorrent, or simply visit one of the PGP international
>mirrors.
>Anybody who obeys export controls is a fool.

I gave you a test. Export it to one of those countries and let your
government know you have done so.
>Like V says: "People shouldn't fear their governments. Governments
>should fear their people".

Perhaps. But I also suspect you have never actually put your words into
action.
Show full article (2.39Kb)
no comments
  Re: CSS: Disk key. Why?         


Author: Tom St Denis
Date: Dec 5, 2006 08:31

Ernest Hammingweight wrote:
> It wasn't personal. I overlooked your response.

No harm no foul no worries.

Tom
no comments
  Re: Need a quick advice plz         


Author: Salami Man
Date: Dec 5, 2006 06:35

"Tom St Denis" gmail.com> wrote in message
news:1165327616.321643.257760@l12g2000cwl.googlegroups.com...
>
> Salami Man wrote:
>> Take some of their advice with a grain of salt. I, by no means, am an
>> expert, but I /will/ tell you that using ROT-13 twice will provide you
>> the
>> same text as the one you started with. ROT-13 shifts the plaintext 13
>> letters forward in the alphabet:
>
> ... it's a joke.
>
> Typically given when people are asking for security primitives for
> situations where there is no security (or the security is weak). As in,
> you could use AES with a constant key of "secretkey", or you could use
> ROT-13, no wait, double ROT-13 for more security!
>
> Tom
Show full article (1.27Kb)
no comments
  Re: CSS: Disk key. Why?         


Author: Ernest Hammingweight
Date: Dec 5, 2006 06:23

Tom St Denis wrote:
> Ernest Hammingweight wrote:
>> Mike Amling wrote:
>>> If there are several titles on the disk, and they have different
>>> title keys (I don't know if that ever actually happens or not.), then
>>> CSS only needs one 409-element list per disk, rather than one
>>> 409-element list per title key. (Albeit one would think that
>>> space-saving would not be a major concern for DVDs.)
>>>
>>> --Mike Amling
>> That sounds plausible. Thanks.
>
> And it's also exactly what I said a few hours earlier. I guess because
> it came from me instead of Mike it was contained less truthiness? Well
> I'm glad we have a wikiality about this subject.
>
> Tom
It wasn't personal. I overlooked your response.
1 Comment