Reputation
393
Top tag
Next privilege 500 Rep.
Cast close & reopen votes
Badges
1 15
Impact
~13k people reached

Jun
4
comment Which version(s) of SRP are in ISO/IEC 11770-4:2006?
Since SE is already impersonal and community-oriented, could you explain, why is ISO/IEC 11770-4:2006 so interesting?
Jun
2
awarded  Quorum
May
31
comment Reversing SHA1 (don't know the correct term)
Well, I overlooked this addition. Seems SHA-1 is resistant against this type of attack, but is it really so?
May
31
revised Reversing SHA1 (don't know the correct term)
separated the answer from things I already know
May
31
suggested approved edit on Reversing SHA1 (don't know the correct term)
May
31
comment How to test if a number is a primitive root?
The person who gave another answer deleted it and probably removed his upvote and unstarred the question :) Or was it someone else?
May
31
comment How to test if a number is a primitive root?
I mistyped. It was p.
May
31
comment How to test if a number is a primitive root?
The output is: <code>PRIME FACTOR x1 PRIME FACTOR x2</code>, so it should check for primarity. And there are only 2 factors.
May
31
comment How to test if a number is a primitive root?
A short and precise answer.
May
31
comment How to test if a number is a primitive root?
I'll write down what I've done and you'll say if I'm right. I tested if the modulus is prime with rabin-miller test, the program is here en.literateprograms.org/Miller-Rabin_primality_test_(Python). It was prime, so I used this ftp.computing.dcu.ie/pub/crypto/factor.exe program to factor the modulus-1 since phi(prime) = prime - 1. It printed out 2 and another prime. So then I calculated g ^ q % (p-1) for all factors where q is the factor and they were != 1. So g should be a generator, right?
May
31
accepted How to test if a number is a primitive root?
May
31
comment Crack SHA1 hash code
@user236501 I think you misunderstood that. You can't change data before unknown values and get a correct hash.
May
31
comment Reversing SHA1 (don't know the correct term)
Would you probably write a short summary of your post? It's hard to read.
May
31
comment Reversing SHA1 (don't know the correct term)
Afaik output of compression function = output of hash function, since opposing to MD5 SHA-1 doesn't have finalisation.
May
30
comment How to test if a number is a primitive root?
Ok, I tested and that number is a safe prime, i.e. p=2q+1, p and q are prime. How to test now whether a number is a primitive root?
May
30
comment How to test if a number is a primitive root?
Assume at least 256 bits. Is there no ready software? What if p-1 is prime too? Do you know a software to test if a number is prime?
May
30
revised How to test if a number is a primitive root?
added 80 characters in body
May
30
comment How to test if a number is a primitive root?
Well, I haven't really understood your answer. Could you give me an algorith to prove it or probably a program source?
May
30
revised Reversing SHA1 (don't know the correct term)
added 369 characters in body
May
30
comment understanding a length extension attack
It's really lot of text, hard to understand. Would help if you explain yourself more shortly.