Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
6
Impact
~1k people reached

  • 0 posts edited
  • 0 helpful flags
  • 10 votes cast
Sep
24
awarded  Autobiographer
Dec
20
awarded  Editor
Dec
20
revised Is this algorithm demonstrating “proof of work”
added 30 characters in body
Dec
20
comment Is this algorithm demonstrating “proof of work”
My algorithm is not for authentication in and of itself , Here is a wikipedia article describing the concept en.wikipedia.org/wiki/Proof-of-work_system
Dec
20
awarded  Student
Dec
20
asked Is this algorithm demonstrating “proof of work”
Sep
29
accepted probability of N hash digits colliding
Sep
17
comment probability of N hash digits colliding
@user pg1989 I am not computing the hash of the file name, i am computing the hash of the file contents, I included a link to my code.
Sep
17
comment probability of N hash digits colliding
But I am not selecting the items randomly, I am selecting the first five. I am not using the decimal number base I am using hexadecimal. Thanks your answer is easy to understand.
Sep
17
asked probability of N hash digits colliding
Aug
29
awarded  Supporter
Jun
28
awarded  Scholar
Jun
28
accepted Is my one time pad cipher secure?
Jun
28
comment Is my one time pad cipher secure?
I was also wondering about the random number generator, the documentation said that; os.urandom(n) Return a string of n random bytes suitable for cryptographic use.
Jun
28
asked Is my one time pad cipher secure?
Jun
18
awarded  Informed