{"id":6714,"date":"2013-12-14T20:39:01","date_gmt":"2013-12-15T01:39:01","guid":{"rendered":"http:\/\/thundercloud.net\/infoave\/new\/?p=6714"},"modified":"2013-12-14T20:44:58","modified_gmt":"2013-12-15T01:44:58","slug":"were-back-to-the-passwords-again","status":"publish","type":"post","link":"https:\/\/www.thundercloud.net\/infoave\/new\/were-back-to-the-passwords-again\/","title":{"rendered":"We’re back to the passwords again"},"content":{"rendered":"

\"password\"<\/a>How long do you think it would take to crack a password like barb49?<\/p>\n

Offline Fast Attack Scenario: (Assuming one hundred billion guesses per second) 0.000622 seconds. Massive Cracking Array Scenario:(Assuming one hundred trillion guesses per second) 0.000000622 seconds;<\/p>\n

Now let’s change that barb49 password to a strong password, let’s say a 15 character password generated by Last Pass’s Password Generator. The generated password is gln5adHH^v4A8md. Now how long would it take to crack that password?<\/p>\n

Offline Fast Attack Scenario:(Assuming one hundred billion guesses per second) 1.49 billion centuries
\nMassive Cracking Array Scenario:(Assuming one hundred trillion guesses per second) 1.49 million centuries<\/p>\n

Do you see the difference? If someone wants to crack passwords and has the right software, they really can make a hundred billion guesses per second.<\/p>\n

You don’t have to use unpronounceable gibberish passwords — but if you’re using a password manager with a password generator, you don’t have to remember them anyway — that’s what the password manager’s for. You can, if you wish generate random 12-letter pronounceable passwords that are fairly strong — but can be cracked if the attacker is determined. Take the password indamutcag for example — it can be cracked in about 24 minutes using Offline Fast Attack Scenario, and less than 3 minutes using a Massive Cracking Array Scenario.<\/p>\n

We’re determined to teach you about passwords. The more you know, the more likely you’ll use strong passwords…and that’s a good thing.<\/p>\n

How do we know all this stuff about cracking passwords? We don’t — so don’t worry — we’re not going to sick EB on you \ud83d\ude42<\/p>\n

We got this information from a very interesting site<\/a>. You can go there right now and test your own passwords if you like.<\/p>\n

Here’s a question posed by the page we’re going to send you to:<\/p>\n

Which of the following two passwords is stronger, more secure, and more difficult to crack?<\/p>\n

D0g…………………<\/p>\n

PrXyc.N(n4k77#L!eVdAfp9<\/p>\n

If you guessed the second one, you’d be wrong.\u00a0You can find out why, here<\/a>\u00a0.. And while your there, check your passwords, before someone else guesses them.<\/p>\n

Here’s some juicy tidbits from the author — just in case you were thinking about avoiding this site and continuing on with your weak passwords:<\/p>\n

“Every password you use can be thought of as a needle hiding in a haystack. After all searches of common passwords and dictionaries have failed, an attacker must resort to a \u201cbrute force\u201d search \u2013 ultimately trying every possible combination of letters, numbers and then symbols until the combination you chose, is discovered.<\/em><\/p>\n

If every possible password is tried, sooner or later yours will be found. The question is: Will that be too soon . . . or enough later?”<\/p><\/blockquote>\n

Interested? We hope so.\u00a0Visit this page to learn more — right now<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"

How long do you think it would take to crack a password like barb49? Offline Fast Attack Scenario: (Assuming one hundred billion guesses per second) 0.000622 seconds. Massive Cracking Array Scenario:(Assuming one hundred trillion guesses per second) 0.000000622 seconds; Now let’s change that barb49 password to a strong password, let’s say a 15 character password generated by Last\u2026 Read More »<\/a><\/span><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1670,1656,10],"tags":[],"_links":{"self":[{"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/posts\/6714"}],"collection":[{"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/comments?post=6714"}],"version-history":[{"count":3,"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/posts\/6714\/revisions"}],"predecessor-version":[{"id":6718,"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/posts\/6714\/revisions\/6718"}],"wp:attachment":[{"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/media?parent=6714"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/categories?post=6714"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.thundercloud.net\/infoave\/new\/wp-json\/wp\/v2\/tags?post=6714"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}