Hi Alex
Thanks for your good, informative reply
I'll try and catch up with the recommended reading
Subu
Alex Mauer - [EMAIL PROTECTED] wrote:
>[EMAIL PROTECTED] wrote:
>
>>I thought that two *non* identical names - as in case below will *not*
>>create the same hash
>>If it will, what is the
Hi Alex
Thanks for your good, informative reply
I'll try and catch up with the recommended reading
Subu
Alex Mauer - [EMAIL PROTECTED] wrote:
>[EMAIL PROTECTED] wrote:
>
>>I thought that two *non* identical names - as in case below will *not*
>>create the same hash
>>If it will, what is the
Mark H. Wood wrote:
> The whole point of using a hash is to make it extremely unlikely that
> either party could recover the plaintext unilaterally. It's like having a
> vault with two different locks, and giving the keys to two different
> people, to make abuse more difficult by requiring collusi
[Alex L. Mauer]
> Can you expand on this?
>
> How could the Name/address/ssn be retrieved from a hash of the same?
>
The data can be recovered from the hash because search space is small.
Say you are looking for the SSN of a John Smith. Every large DB is bound
to have someone named John Smith.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wed, 25 May 2005, Alex L. Mauer wrote:
> Florian Weimer wrote:
> > * Sean C.:
> >>The I.B.M. software would convert data on a person into a string of
> >>seemingly
> >>random characters, using a technique known as a one-way hash function. No
> >>na
-BEGIN PGP SIGNED MESSAGE-
Hash: RIPEMD160
Sean C. wrote:
>
> I'm confused though.
> I just read this article from the New York Times. As a newbie to encryption
> and
> hash algorithms I thought the idea behind hashes was that you couldn't
> reconstruct the data from the hash.
>
You ca
Florian Weimer wrote:
* Sean C.:
The I.B.M. software would convert data on a person into a string of seemingly
random characters, using a technique known as a one-way hash function. No
names, addresses or Social Security numbers, for example, would be embedded
within the character string.
F
[EMAIL PROTECTED] wrote:
> I thought that two *non* identical names - as in case below will *not*
> create the same hash
> If it will, what is the probability ?
The probability of this happening is extremely low.
For a 128-bit hash, such as md5, the probability is 1 in 2^128 (1 in
340,282,366,92
* Sean C.:
> The I.B.M. software would convert data on a person into a string of seemingly
> random characters, using a technique known as a one-way hash function. No
> names, addresses or Social Security numbers, for example, would be embedded
> within the character string.
For most applications
Hi
>
>This also illustrates some problems with the system, namely hash
>collisions (two people generate the hash "baz")
>
I thought that two *non* identical names - as in case below will *not*
create the same hash
If it will, what is the probability ?
Thanks
Subu
Alex Mauer - [EMAIL PROT
Sean C. wrote:
> I'm confused though.
> I just read this article from the New York Times. As a newbie to encryption
> and
> hash algorithms I thought the idea behind hashes was that you couldn't
> reconstruct the data from the hash.
You can't. But you can use the hash as a key to cross-referenc
http://tinyurl.com/dljdm
See comment at bottom.
Business/Financial Desk; SECTCTECHNOLOGY
I.B.M. Software Aims to Provide Security Without Sacrificing Privacy
By STEVE LOHR
624 words
24 May 2005
The New York Times
Late Edition - Final
4
English
Copyright 2005 The New York Times Company. All Rights
12 matches
Mail list logo
