List your passwords alphabetically, so it's easy for you and others to find them!
Give three password crackers a list of 16,000 cryptographically hashed passwords and ask them to come up with the plaintext phrases they correspond to. That's what Ars did this week in Dan Goodin's Anatomy of a hack: How crackers ransack passwords like “qeadzcwrsfxv1331.” Turns out, with just a little skill and some good hardware, three prominent password crackers were able to decode up to 90 percent of the list using common techniques.
The hashes the security experts used were converted using the MD5 cryptographic hash function, something that puzzled our readers a bit. MD5 is seen as a relatively weak hash function compared to hashing functions like bcrypt. flunk wrote, "These articles are interesting but this particular test isn't very relevant. MD5 wasn't considered a secure way to hash passwords 10 years ago, let alone now. Why wasn't this done with bcrypt and salting? That's much more realistic. Giving them a list of passwords that is encrypted in a way that would be considered massively incompetent in today's IT world isn't really a useful test."
To this, Goodin replied that plenty of Web services employ weak security practices: "This exercise was entirely relevant given the huge number of websites that use MD5, SHA1, and other fast functions to hash passwords. Only when MD5 is no longer used will exercises like this be irrelevant." Goodin later went on to cite the recent compromises of "LinkedIn, eHarmony, and LivingSocial," which were all using "fast hashing" techniques similar to MD5.
- Allie Wilkinson
- Android
- Ars Technica
- Atari
- Bcrypt
- Computer security
- Congress
- Crypt
- Cryptographic hash functions
- Cryptographic software
- Cryptography
- Cyberwarfare
- Dan Goodin
- eHarmony
- encryption
- facial recognition
- grant applications
- guaranteed Internet Password Minder
- Isle Royale
- Joe Mullin
- Jon Brodkin
- Lake Superior
- Linux
- little food
- LivingSocial
- Mark Shuttleworth
- Megan Geuss
- Microsoft
- operating system
- Password
- Password cracking
- Risk Assessment
- Salt
- Search algorithms
- Sero 7 Lite
- SHA-1
- Texas
- The Guardian
- The Guardian Review
- United Nations
- web services
- Week in Review
Thanks to the XKCD comic, every password cracking word list in the world probably has correcthorsebatterystaple in it already.
Aurich Lawson
In March, readers followed along as Nate Anderson, Ars deputy editor and a self-admitted newbie to password cracking, downloaded a list of more than 16,000 cryptographically hashed passcodes. Within a few hours, he deciphered almost half of them. The moral of the story: if a reporter with zero training in the ancient art of password cracking can achieve such results, imagine what more seasoned attackers can do.
Imagine no more. We asked three cracking experts to attack the same list Anderson targeted and recount the results in all their color and technical detail Iron Chef style. The results, to say the least, were eye opening because they show how quickly even long passwords with letters, numbers, and symbols can be discovered.
The list contained 16,449 passwords converted into hashes using the MD5 cryptographic hash function. Security-conscious websites never store passwords in plaintext. Instead, they work only with these so-called one-way hashes, which are incapable of being mathematically converted back into the letters, numbers, and symbols originally chosen by the user. In the event of a security breach that exposes the password data, an attacker still must painstakingly guess the plaintext for each hash—for instance, they must guess that "5f4dcc3b5aa765d61d8327deb882cf99" and "7c6a180b36896a0a8c02787eeafb0e4c" are the MD5 hashes for "password" and "password1" respectively. (For more details on password hashing, see the earlier Ars feature "Why passwords have never been weaker—and crackers have never been stronger.")
- :LOL1313le
- account hijacking
- AMD
- Ars Technica
- Bloomberg
- Computer law
- Computer security
- Coneyisland9/
- Congress
- Crack
- Cracking
- cracking software
- Crimes
- Crypt
- Cryptographic hash functions
- Cryptography
- Dan Goodin
- Data breaches
- facial recognition
- Features
- Garrett1993*
- GPU
- grant applications
- graphics processor
- graphics processor
- MD5
- Nate Anderson
- operating systems
- Oscar
- Password
- Password cracking
- password-cracking software
- passwords
- Risk Assessment
- Security
- Sero 7 Lite
- software makes
- Stricture Consulting Group
- System administration
- System software
- Technology Lab
- The Associated Press
- The Guardian
- The Guardian Review
- Unix
hypnosec writes "BLAKE2 has been recently announced as a new alternative to the existing cryptographic hash algorithms MD5 and SHA-2/3. With applicability in cloud storage, software distribution, host-based intrusion detection, digital forensics and revision control tools, BLAKE2 performs a lot faster than the MD5 algorithm on Intel 32- and 64-bit systems. The developers of BLAKE2 insist that even though the algorithm is faster, there are no loose ends when it comes to security. BLAKE2 is an optimized version of the then SHA-3 finalist BLAKE."
Read more of this story at Slashdot.
Enlarge / A slide from Steube's presentation outlining a more efficient way to crack passwords protected by the SHA1 cryptographic algorithm.
A researcher has devised a method that reduces the time and resources required to crack passwords that are protected by the SHA1 cryptographic algorithm.
The optimization, presented on Tuesday at the Passwords^12 conference in Oslo, Norway, can speed up password cracking by 21 percent. The optimization works by reducing the number of steps required to calculate SHA1 hashes, which are used to cryptographically represent strings of text so passwords aren't stored as plain text. Such one-way hashes—for example 5baa61e4c9b93f3f0682250b6cf8331b7ee68fd8
to represent "password" (minus the quotes) and e38ad214943daad1d64c102faec29de4afe9da3d
for "password1"—can't be mathematically unscrambled, so the only way to reverse one is to run plaintext guesses through the same cryptographic function until an identical hash is generated.
Jens Steube—who is better known as Atom, as the pseudonymous developer of the popular Hashcat password-recovery program—figured out a way to remove identical computations that are performed multiple times from the process of generating of SHA1 hashes. By precalculating several steps ahead of time, he's able to skip the redundant steps, shaving 21 percent of the time required to crack large numbers of passwords. Slides from Tuesday's presentation are here.
- AMD
- Ars Technica
- BLAKE
- Bloomberg
- Computer law
- Crimes
- Crypt
- cryptographic algorithm
- Cryptographic hash functions
- cryptography
- Cryptography
- cryptography
- Dan Goodin
- encryption
- Errata Security
- GPU
- Jean-Philippe Aumasson
- Jens Steube
- Jeremi Gosney
- Key management
- MD5
- Norway
- Oslo
- Password
- Password cracking
- passwords
- PBKDF2
- Risk Assessment
- Rob Graham
- Salt
- SHA-1
- SHA1 cryptographic algorithm
- SHA3 algorithm
- Switzerland
- Technology Lab
- The Associated Press
An overview of a chosen-prefix collision
Flame
- Flame espionage malware issues self-destruct command
- Flame's "god mode cheat code" wielded to hijack Windows 7, Server 2008 (Updated)
- Flame malware wielded rare "collision" crypto attack against Microsoft
- Flame malware hijacks Windows Update to spread from PC to PC
- Iran-targeting Flame malware used huge network to steal blueprints
The Flame espionage malware that infected computers in Iran achieved mathematic breakthroughs that could only have been accomplished by world-class cryptographers, two of the world's foremost cryptography experts said.
"We have confirmed that Flame uses a yet unknown MD5 chosen-prefix collision attack," Marc Stevens and B.M.M. de Weger wrote in an e-mail posted to a cryptography discussion group earlier this week. "The collision attack itself is very interesting from a scientific viewpoint, and there are already some practical implications."
"Collision" attacks, in which two different sources of plaintext generate identical cryptographic hashes, have long been theorized. But it wasn't until late 2008 that a team of researchers made one truly practical. By using a bank of 200 PlayStation 3 consoles to find collisions in the MD5 algorithm—and exploiting weaknesses in the way secure sockets layer certificates were issued—they constructed a rogue certificate authority that was trusted by all major browsers and operating systems. Stevens, from the Centrum Wiskunde & Informatica in Amsterdam, and de Weger, of the Technische Universiteit Eindhoven were two of the driving forces behind the research that made it possible.
- Amsterdam
- Ars Technica
- Associated Press
- bank
- Birthday attack
- Bloomberg
- Collision
- Computing
- Cryptographic hash functions
- Cryptography
- cryptography
- CrySyS Lab
- Dan Goodin
- de Weger
- encryption
- espionage
- forensic tool
- Hashing
- Islamic Republic of Iran
- Johns Hopkins University
- Kaspersky Lab.
- malware
- Malware
- Marc Stevens
- Mathematics
- Matthew Green
- MD5
- MD5 algorithm
- Microsoft
- operating systems
- PlayStation 3
- Risk Assessment
- Scientific Method
- Symantec
- Bitbucket
- buggy software
- Commit
- Computer programming
- Computing
- Continuous integration
- Cryptographic hash functions
- Cryptography
- Distributed revision control
- distributed revision control systems
- download software
- Egor Homakov
- free software projects
- Git
- GitHub
- Gitorious
- Google Code
- internal network
- john doe
- Linus Torvalds
- Linux
- nix
- operating system
- PC
- private key
- public key
- Public-key cryptography
- quickest solution
- Repo
- Revision control
- Ruby on Rails
- secret key
- secure migration solution
- separate web
- Sourceforge
- Version control
- Who Do You Trust
- Associative array
- collision resolution algorithm
- collision resolution algorithm
- Computer programming
- Computer science
- Computing
- Cryptographic hash functions
- Data structures
- Error detection and correction
- hash algorithm
- hash algorithm
- Hash function
- Hash table
- Hashing
- Java
- Java
- Perl
- Perl
- php
- php
- Python
- Ruby
- Search algorithms
- search parameters
- Trie
- two algorithms