ctacke/>
Wed Nov 23 19:14:11 CST 2005
It could be as simple as running a 32 bit CRC on the username with a custom
"secret" algorithm as the base instead of a commonly accepted algorithm.
Not overly secure, but easy enough to implement, pretty certain to give a
unique hash for every username, and "secure" enough to keep blatant amateurs
from figuring it out.
-Chris
"Nathan Laff" <nlaff@comcast.nospam.net> wrote in message
news:Me6dnQfQv4VTZhnenZ2dnUVZ_tednZ2d@comcast.com...
> but i clearly don't understand what to do :)
>
> maybe an example?
> s
> "Ilya Tumanov [MS]" <ilyatum@online.microsoft.com> wrote in message
> news:4384e8d4$1@news.microsoft.com...
>> You really don't want anybody to know how it works exactly, so it's up to
>> you to come up with the solution and keep it secret. :)
>>
>>
>> Best regards,
>>
>> Ilya
>>
>> This posting is provided "AS IS" with no warranties, and confers no
>> rights.
>>
>> *** Want to find answers instantly? Here's how... ***
>>
>> 1. Go to
>>
http://groups-beta.google.com/group/microsoft.public.dotnet.framework.compactframework?hl=en
>> 2. Type your question in the text box near "Search this group" button.
>> 3. Hit "Search this group" button.
>> 4. Read answer(s).
>>
>> "Nathan Laff" <nlaff@comcast.nospam.net> wrote in message
>> news:9p-dnRv_ipCRfhneRVn-iA@comcast.com...
>>> yeah, MD5 is a bit more then i needed.
>>>
>>> HashCodes seem to be what i want to use, but how would i use this in a
>>> Licence Key scenario?
>>>
>>> thanks so much!
>>>
>>> "Ilya Tumanov [MS]" <ilyatum@online.microsoft.com> wrote in message
>>> news:4384de64$1@news.microsoft.com...
>>>> If you have initial string, yes, that would be easy. But it would be
>>>> easy no matter what you use for hashing in this case.
>>>>
>>>> Anyway, you could use, say, industry standard MD5 if you believe it's
>>>> more secure.
>>>>
>>>>
>>>> Best regards,
>>>>
>>>> Ilya
>>>>
>>>> This posting is provided "AS IS" with no warranties, and confers no
>>>> rights.
>>>>
>>>> *** Want to find answers instantly? Here's how... ***
>>>>
>>>> 1. Go to
>>>>
http://groups-beta.google.com/group/microsoft.public.dotnet.framework.compactframework?hl=en
>>>> 2. Type your question in the text box near "Search this group" button.
>>>> 3. Hit "Search this group" button.
>>>> 4. Read answer(s).
>>>>
>>>> "Nathan Laff" <nlaff@comcast.nospam.net> wrote in message
>>>> news:nImdnYFk498SRxnenZ2dnUVZ_sqdnZ2d@comcast.com...
>>>>> How would i use that to create passwords/keys from a string?
>>>>> seems like that would be pretty easy to crack :)
>>>>>
>>>>> "Ilya Tumanov [MS]" <ilyatum@online.microsoft.com> wrote in message
>>>>> news:4384c921$1@news.microsoft.com...
>>>>>> You're probably talking about hash, not encryption. If so, just use
>>>>>> String.GetHashCode().
>>>>>>
>>>>>> Encryption would generate data with size proportional to original and
>>>>>> can be decrypted back.
>>>>>>
>>>>>> With hash you get a fixed size number which can not be restored back
>>>>>> to the original.
>>>>>>
>>>>>>
>>>>>>
>>>>>> You could use OpenNETCF.Security.Cryptography namespace with NETCF
>>>>>> V1.
>>>>>>
>>>>>> NETCF V2 has native encryption support in
>>>>>> System.Security.Cryptography namespace.
>>>>>>
>>>>>> It also has hashing support.
>>>>>>
>>>>>>
>>>>>>
>>>>>> Best regards,
>>>>>>
>>>>>>
>>>>>> Ilya
>>>>>>
>>>>>> This posting is provided "AS IS" with no warranties, and confers no
>>>>>> rights.
>>>>>>
>>>>>> *** Want to find answers instantly? Here's how... ***
>>>>>>
>>>>>> 1. Go to
>>>>>>
http://groups-beta.google.com/group/microsoft.public.dotnet.framework.compactframework?hl=en
>>>>>> 2. Type your question in the text box near "Search this group"
>>>>>> button.
>>>>>> 3. Hit "Search this group" button.
>>>>>> 4. Read answer(s).
>>>>>>
>>>>>> "Nathan Laff" <nlaff@comcast.nospam.net> wrote in message
>>>>>> news:fbqdnSQ7a9FPXhnenZ2dnUVZ_v-dnZ2d@comcast.com...
>>>>>>> i'm looking for a very simple encryption / decryption algorithm.
>>>>>>> for example a string would be encrypted into a string containing
>>>>>>> only 6-8 numbers.
>>>>>>>
>>>>>>> Which method would I use here?
>>>>>>>
>>>>>>> Thank you!
>>>>>>>
>>>>>>
>>>>>>
>>>>>
>>>>>
>>>>
>>>>
>>>
>>>
>>
>>
>
>