Reputation
6,631
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 11 34
Newest
 Quorum
Impact
~162k people reached

Aug
21
comment Combine two sha512 hashes to a single hash
en.wikipedia.org/wiki/Length_extension_attack
Aug
21
answered Digital Signature Attack
Aug
19
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 77 characters in body
Aug
18
comment Is calculating HMAC from hashed input a good idea?
Doesn't the fact that breaking HMAC generally requires a greater effort than finding a collision in the underlying hash algorithm, mean the answer is "yes"?
Aug
17
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 7 characters in body
Aug
17
revised Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$
added 1301 characters in body
Aug
16
revised Anonymous offline digital cash scheme
added 989 characters in body
Aug
15
answered Anonymous offline digital cash scheme
Aug
15
comment Anonymous offline digital cash scheme
The answer to the question, as currently worded, ought to be "no". Blind signatures are online by definition, so a digital cash system based on blind signatures can't be (completely) offline.
Aug
10
comment Order of MACing and Encrypting in TLS
Some servers are updated. Technically, a modern browser and a modern server might still negotiate an older version of TLS. Since there are still a lot of buggy TLS 1.0 servers out there that will choke on TLS 1.1 and later, some generic TLS clients solve that by only enabling TLS 1.0 by default, unless they know for sure the server supports later versions.
Aug
10
comment Order of MACing and Encrypting in TLS
RFC 7366 is widely implemented, e.g. by Chrome, Mozilla, OpenSSL etc.
Aug
10
answered Order of MACing and Encrypting in TLS
Jul
29
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
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?