Spyke
db2
lemmy.world

isFirstSuccessfulLoginAttempt

Important distinction.

170
dalekcaanreply
feddit.nl

Yeah, as it is it only works if the brute force algorithm gets it on the first try.

35
sgareply
piefed.social

i guess you mean bogo sort? just verifying that output is sorted requires O(n). In Quantum bogo sort, you can skip verification.

1
Jimbabwereply
lemmy.world

Yeah, stupid autocorrect. And verifying ain’t the same as doing. I’ll come in, I’ll “sort” your data, and I’ll do it damn fast. You want verification that’s extra!

2
sgareply
piefed.social

but how do you know you are done. maybe there are different ideas of what bogo sort is, but as i remember, it is basically a while true (or while false loop) with condition - while list_is_not_sorted { return_a_random_ordering }

2

Yeah but I said in the best case. In the best case, your randomization is correct so you don’t need to check it

1

Not even then. Brute force cracking programs don't rely on the server to indicate if the attempted password is correct.

1
feddit.org

Even worse the silent invalidation of a correct password.

Use password manager.

Can't log in, because "password is incorrect"... Fuck you! It is not! I copied in the same fucking thing as months before! If you want to force me to change it then say it! Asshole!

40
fedia.io

It rejects the first [correct] login attempt (it’s worded poorly). It assumes that a brute force attacker will try any given password once and move on, while a human user will think they made a typo and try again. This works until the attacker realizes that it takes two attempts, in which case it merely doubles the attempts required to breach the account, and simply requiring an additional password character would be vastly more effective.

80

Hey now, I'm sure there's someone on LinkedIn suggesting this exact thing with layers of corporate speak.

15

Agreed, and also makes it readily known that that is what you are doing.

The sneakier more user friendly way to implement it would be to require the second correct attempt only if the user has made an incorrect attempt since the last successful login.

16

Look, we all need to pay a little for the greater good of security.

/s

4

Yup it’s like how software companies will get a hate on for pirates and take it out on their loyal paying cutosmers

4

All tools that bruteforce passwords attempt each password only once, and if it doesn't work, discard it. Nobody really runs 2 identical attacks back to back (they're incredibly slow when done over the internet), so the password would seem uncrackable at first glance.

This approach wouldn't work with hash cracking, vault breaking or file encryption, because once they get their hands on the hash/vault/file, the attacker can use their own code for hashing/checking a password candidate.

23

Don't worry, a not-insignificant number of users probably use "Forgot Password?" every time because they can't keep track of the correct one. Lol

I suspect this is why we started to see all those "use a temporary password instead" options lately. XD

2
TheseusNowreply
lemmy.zip

It doesn't. Cracking programs don't use the user login form repeatedly. They use the same algorithm that creates the publicly encoded password to generate encoded passwords and keep going until they have a match. Besides getting the encoded password and salt, everything is done offline.

This just creates a really bad user experience.

5

If they actually use the real login form, most websites block an account after X attempts. Sometimes for 1-24 hours, sometimes until you do a PW reset

2
lemmy.world

At least make it if !isPasswordCorrect || isFirstTry

9
accideathreply
feddit.org

You are very confident in your ability to not make a typo.

19

How to make a typo when using password manager?

I tell you how. Password manager fills the input just a bit too fast so that misused react handler goes into race condition and skips last character.

15

I prefer a password system that I can memorise or derive.
Although, fair, I do also use a pm.

1

You reached the end