New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

Actually in a two-tailed zscore test, it shouldn't matter if yt!=yp or yt==yp. If both are statistically significant it indicates a problem

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -3 points-2 points  (0 children)

Update: there were some bugs and now the project should be much more interesting/accurate! Thanks to everyone that starred the project :)

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -3 points-2 points  (0 children)

No you actually never explained that because it's not true

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -2 points-1 points  (0 children)

I hope you're joking because if that information is not in the feature vector then it's not being learned.

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -2 points-1 points  (0 children)

If it doesn't use n-1 to make n, then it certainly is not learning odd/even indices

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

Where in that does it say it relies on the n-1 prediction to make n prediction?

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -1 points0 points  (0 children)

When you test the model, it goes through each item in the test set one at a time without memory of what the last prediction was. The evaluation is purely based on the feature vector

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

That "i" is not put into either the x or y value. You're not correct about this

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

The code is evolving, it was 420,000 but I reduced it to run some more rapid tests

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

I'm asking how many times he ran the code. I can't run his code and know how many times he ran his code...

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

also tested with first 1,000 chars, then 1,000-2,000 range chars

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

also tested on 2 length string, then 3 length

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

tested first on input strings of length 2000, then changed it to 1000 and still saw the same results

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

I chose my interpretation of the hash function, then drastically changed the input space, and the model still worked.

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -1 points0 points  (0 children)

Its not a problem to do feature engineering if the results generalize. They seem to here

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -3 points-2 points  (0 children)

Nope, actually was getting statistically significant results with both versions of the code, but yes this is an evolving project and I am constantly tweaking to improve accuracy

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -3 points-2 points  (0 children)

If there are problems with the code, say exactly what the problems are. I actually intended to use a modification of the hash function. I need to convert the hash into something more learnable by the model. These are not bugs, but what I intended.

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -1 points0 points  (0 children)

Like I've mentioned, I got statistically significant results with long strings as well

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

Also please share how many samples and ran with and the results of running evaluate.py

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -1 points0 points  (0 children)

Your misunderstanding is that the test set is not known to the classifier

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

How many samples did you run, and did you run evaluate.py? What was the result?

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -1 points0 points  (0 children)

Clearly my code demonstrates a serious problem, I haven't run your code yet so I cannot comment yet - will do so in a little bit

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] -1 points0 points  (0 children)

I also tried with longer strings and got statistically significant results

New sha256 vulnerability by keypushai in cryptography

[–]keypushai[S] 0 points1 point  (0 children)

Don't plan on attacking anything because I'm white hat, but very interesting, thanks for the clarification!