Pigeon Feed
View unanswered posts | View active topics It is currently Tue Jan 16, 2018 11:59 pm



Reply to topic  [ 5 posts ] 
 Announcing the first SHA1 collision 
Author Message
User avatar

Joined: Thu Mar 31, 2011 4:00 pm
Posts: 10071
Post Announcing the first SHA1 collision
Google has found a way to create collisions in SHA-1.

Cryptography functions using sha-1 now becomes a risk

Google security blog

The Shattered link demostrates the proof.


Tue Feb 28, 2017 3:55 am
Profile
User avatar

Joined: Mon Apr 11, 2011 6:55 pm
Posts: 6494
Post Re: Announcing the first SHA1 collision
Amazing.

I cannot imagine any public encryption algorithms or other methods not already cracked by big GOVs.


Tue Feb 28, 2017 4:43 am
Profile
User avatar

Joined: Thu Mar 31, 2011 4:00 pm
Posts: 10071
Post Re: Announcing the first SHA1 collision
It's a hash, not encryption. Not sure they have all encryption broken. Someday, yes, due to power.


Tue Feb 28, 2017 5:51 am
Profile
User avatar

Joined: Mon Apr 11, 2011 6:55 pm
Posts: 6494
Post Re: Announcing the first SHA1 collision
hash is based on a count in the encryption?


Tue Feb 28, 2017 6:13 am
Profile
User avatar

Joined: Thu Mar 31, 2011 4:00 pm
Posts: 10071
Post Re: Announcing the first SHA1 collision
Hashing creates a fixed length of text that is not reversible and hopefully doesn't generate the same output for different inputs. (collisions)

Encryption hides the text, is not a fixed length and is reversible. Obviously, one wants that decode to only be possible with the proper key.

They are different processes.


Tue Feb 28, 2017 6:41 am
Profile
Display posts from previous:  Sort by  
Reply to topic   [ 5 posts ] 

Who is online

Users browsing this forum: No registered users and 1 guest


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to:  
cron
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group.