Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

STACIE computation is really long time for large round numbers. #40

Closed
LBiv opened this issue Jul 10, 2015 · 2 comments
Closed

STACIE computation is really long time for large round numbers. #40

LBiv opened this issue Jul 10, 2015 · 2 comments

Comments

@LBiv
Copy link
Contributor

LBiv commented Jul 10, 2015

I should have opened this issue a while ago, but I want to put it down on paper just so that we don't forget about this. We'll have to look over the stacie code again from a performance standpoint.
@ladar
Copy link
Member

ladar commented Apr 5, 2016

@LBiv I don't understand. Seems quick to me... unless the password is short, and/or you have a lot of bonus rounds. Then its computationally difficult by design.

@LBiv
Copy link
Contributor Author

LBiv commented Apr 5, 2016

I believe it was so long that the tests were timing out when testing near the lower boundary. Which I guess isn't the end of the world, just shouldn't test passwords that short.

@LBiv LBiv closed this as completed Apr 5, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@ladar @LBiv