Reputation
5,976
Next tag badge:
71/100 score
18/20 answers
Badges
1 11 33
Newest
 Custodian
Impact
~128k people reached

Mar
12
reviewed Close Decrypting DES with decrypted and encrypted data
Mar
9
reviewed Delete Standard serialization format for libsodium-based messages
Mar
9
reviewed Close Will SHA1 or Other Hash Functions Ever Contain Quotes
Mar
9
comment Will SHA1 or Other Hash Functions Ever Contain Quotes
I'm voting to close this question as off-topic because this is an apples and oranges kind of question. SHA-1 will output a string of 160 bits. A quote character is a character and not a bit. Your question will only make sense, if there is an implied conversion algorithm from the bit string output of SHA-1, to the character string you store in your database. This conversion algorithm might be chosen independently of the hash algorithm. Hence, your question is off-topic.
Feb
23
reviewed Close Figure out the encryption being used
Feb
17
reviewed Close Crack RSA with additional information
Feb
17
reviewed Reviewed How many attempts does it take to crack a 32-bit password hash with this scenario?
Feb
17
comment How many attempts does it take to crack a 32-bit password hash with this scenario?
Could you explain, in pseudo-code, exactly what you mean by "attempts" in the context of "matching a 32-bit hash from 4 million hashes". Finding a value that is known to exist in a list of 4 million values, depends on whether the list is already sorted or not, and does not depend of what kind of values are in the list or how they were generated.
Feb
17
reviewed Close Affine transformation in finite field SubBytes
Feb
17
awarded  Custodian
Feb
17
reviewed Reviewed Given infinite unencrypted and encrypted texts, can I find the algorithm?
Feb
17
reviewed Close How to store and use a Cryptographic Seed in a database
Feb
17
reviewed Close Is the SILC protocol still used?
Feb
17
reviewed Close Hardness assumptions on composite order bilinear groups
Feb
16
comment ECC considered secure in OpenSSL?
The term "safe curve" seems to be used by Bernstein for curves that meet certain criteria, selected to make it easy to ensure that simple implementations are secure implementations. This doesn't imply that "non-simple" implementations using other curves are not secure. Hence, the information provided on the page is insufficient to infer anything about the security of OpenSSL, although it does raise some flags.
Feb
8
awarded  Yearling
Feb
3
awarded  Enlightened
Feb
3
awarded  Nice Answer
Jan
12
awarded  Custodian
Jan
12
reviewed Leave Closed Is there a client-side program to cryptography a HTML page and decode if correct password is writen?