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

1d
reviewed Close i cant understand the meaning and the difference between linearity equation and affine and non linearity?
Jul
27
accepted Do Gap-CDH groups exist?
Jul
11
reviewed Reviewed How are primes generated for RSA?
Jul
10
comment Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
@Pierre: (Generalized) Tonelli-Shanks is an algorithm for finding (arbitrary) roots in cyclic groups. It's not the same thing, far from it, but if you see a connection, please feel free to demonstrate it.
Jul
7
reviewed Close computational complexity class of decryption of AES
Jul
5
reviewed Close What are the advantages of using OFB (Output Feedback Mode)?
Jul
3
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.
Jul
3
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?
Jul
3
reviewed Leave Open Easy explanation of “IND-” security notions?
Jul
3
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
Jul
1
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