Reputation
5,741
Next tag badge:
64/100 score
17/20 answers
Badges
1 11 33
Newest
 Custodian
Impact
~117k people reached

16h
comment Working on subgroup of $\mathbb{Z}^*_p$ in practice
It is important to know in exactly what sense you "need to work on some elements not in the subgroup". Your question does not include any reference to any cryptographic scheme or algorithm.
16h
comment Working on subgroup of $\mathbb{Z}^*_p$ in practice
It is unclear what you are asking. Are you asking what role large multiplicative subgroups play in cryptography, or do you simply want to know more about the algebraic properties of the fields and groups involved?
18h
reviewed Leave Open Easy explanation of “IND-” security notions?
18h
comment Easy explanation of “IND-” security notions?
No, I don't think it is a duplicate. You will not necessarily understand the precise meaning of IND-CPA just because you know what is meant by a Chosen Plaintext Attack, etc
2d
comment Deriving HMAC key and cipher key from passphrase?
@mistika: It depends on which algorithms you use for the generic EtA composite scheme. In some cases your scheme will break down completely if you use the same key for both (e.g. if you combine AES-CBC for confidentiality with AES-CBC-MAC for authentication). In other cases the algorithms are likely different enough for there not to be any practical attacks, should you use the same key for both components. However, you can't prove that the generic composition by itself is as secure as the least secure component, unless your premise is that the components use independent keys.
May
9
comment Difference between “Signature Algorithm” and “Signature Hash Algorithm” in X.509
RSASSA-PSS is a completely different beast altogether. A correct representation would require not only Signature Algorithm and Signature Hash Algorithm, but also identifiers for MGF Algorithm and P Source. This is however beside the point.
Mar
23
reviewed Close AES encryption takes more time to decrypt than encrypt
Mar
21
awarded  Custodian
Mar
21
reviewed Satisfactory Do any stream ciphers with aperiodic keystreams exist?
Mar
12
reviewed Close Key length requirement in a simple XOR implementation
Mar
12
reviewed Close How to compute accumulated values in bilinear map accumulators
Mar
12
reviewed Close Remove padding (CBC) from decrypted text
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.