meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 3 months |
| seen | 16 mins ago | |
| stats | profile views | 29 |
|
Apr 4 |
comment |
Attack on DSA with signatures made with k, k+1, k+2 All operations are performed in the field $\mathbb Z_q$, which is why $(\mod q)$ is there all the way. For instance, division means multiplying the numerator by the multiplicative modular inverse of the denominator. |
|
Apr 4 |
revised |
Attack on DSA with signatures made with k, k+1, k+2 added 166 characters in body |
|
Apr 4 |
answered | Attack on DSA with signatures made with k, k+1, k+2 |
|
Apr 4 |
comment |
RSA digital signature vs authenticated cipher That is AES-CBC-then-HMAC-SHA-256. AES-GCM is technically AES-CTR-then-GHASH. |
|
Apr 3 |
comment |
RSA digital signature vs authenticated cipher AES-GCM does not use a SHA256 hash, as has been told in both answers and some comments. However, you might for some reason need to pass your key material through a KDF to generate the actual AES-GCM key before you instantiate AES-GCM, and that KDF might be based on SHA256. Is that what you mean? |
|
Apr 2 |
comment |
RSA digital signature vs authenticated cipher By AES-GCM-SHA256, do you mean a scheme that uses a SHA256 based KDF, as in RFC 5288 specifying AES-GCM cipher suites for TLS? |
|
Apr 1 |
comment |
Voice Call Safety This question might be better asked in security.SE. From a cryptographic POV the answer is negative, for the reasons you state, but banks are known to take calculated risks for various reasons. That is rather a general security question than a cryptographic question. |
|
Mar 31 |
awarded | Custodian |
|
Mar 31 |
answered | What's the difference between Trapdoor Functions and Encryption Functions? |
|
Mar 31 |
asked | Predicate Encryption supporting disjunctions |
|
Mar 29 |
revised |
What does the expression $1^n$ mean as a function argument? added 470 characters in body |
|
Mar 29 |
comment |
What does the expression $1^n$ mean as a function argument? @PaŭloEbermann: Thanks, the link wasn't available when I wrote my first reply. FWIW the definitions only mention that the same security parameter is also an implicit parameter of the set of attributes and set of predicates. On what page did you find the reference to polynomial time setup? |
|
Mar 28 |
revised |
What does the expression $1^n$ mean as a function argument? added 553 characters in body |
|
Mar 28 |
answered | What does the expression $1^n$ mean as a function argument? |
|
Mar 27 |
comment |
one-time pad key related attack Very related to this question crypto.stackexchange.com/questions/2264/… |
|
Mar 27 |
answered | Potential vulnerability in DH key selection - am I understanding this right? |
|
Mar 27 |
comment |
How to use HMAC for large ciphertexts over TLS @PaŭloEbermann: Yes, if datatracker.ietf.org/doc/rfc4366 is implemented. It specifies mechanisms for negotiating both the maximum fragment length and the mac length. |
|
Mar 26 |
comment |
How to use HMAC for large ciphertexts over TLS @rsa: That sounds like a hardware specific or API specific question. |
|
Mar 26 |
comment |
Solving hard problems in $\mathbb Z_{p}^{*}$ when $\mathbb p$ is close to $\mathbb 2^{n}$ @fgrieu: I suspect you interpreted $n$ as the magnitude of the modulus. $n$ is the actual modulus, so for a 1024 bit modulus, $\log n = 1024 \log 2$ etc. |
|
Mar 26 |
accepted | Solving hard problems in $\mathbb Z_{p}^{*}$ when $\mathbb p$ is close to $\mathbb 2^{n}$ |
