Reputation
13,641
Next tag badge:
99/100 score
17/20 answers
Badges
1 34 70
Impact
~260k people reached

Dec
6
awarded  Popular Question
Dec
5
revised Probability approximation of no collisions
added 226 characters in body
Dec
5
revised Probability approximation of no collisions
added 226 characters in body
Dec
5
comment Probability approximation of no collisions
@user822719 Yes. The factor 2 in the denominator comes from $1+2+3+ ... +(t-1)=\frac{t\cdot(t-1)}{2}$.
Dec
5
revised Probability approximation of no collisions
added 35 characters in body; edited tags
Dec
5
answered Probability approximation of no collisions
Dec
4
comment How can I factorize a 350 bit (106 decimal digits) number in two prime factors?
What kind of machine is that?
Dec
4
revised Implicit authentication aritcle
added 72 characters in body
Dec
3
comment Does including the size of the hashed data improve security over just the hash
When you have an incorrectly implemented Merkle tree hash (pretty common, e.g. Bitcoin and Amazon fell for that), you need to compare the size as well.
Dec
3
comment Is every output of a hash function possible?
Duplicate on stackoverflow: Do cryptographic hash functions reach each possible value, e.g. are they surjective?
Dec
2
comment Few questions about CBC MAC
Fixed length messages is a sufficient but not a necessary condition for CBC-MAC's security. It's enough if no message is the prefix of another message. A length prefix is one way of achieving that.
Dec
1
comment Big block cipher as memory-hard function
Should be vulnerable to a variant of the attack where you store sqrt(n) values and recompute the rest on demand.
Dec
1
awarded  Good Answer
Nov
30
comment Are there comprehensive alternatives to RSA?
Group based crypto (elliptic curves and finite fields) supports both signing (DSA, Schnorr, etc.) and encryption (ECIES/DLIES). But using a single key for both may not be the best idea (just like it may not be the best idea with RSA).
Nov
30
revised Cryptographic operations for NISTP256 can be implemented using montgomery method?
edited title
Nov
30
comment Why does the time complexity of RSA encryption and decryption depend on the size of the modulus?
The cost of multiplying numbers depends on the size of those numbers.
Nov
29
revised What is the difference between LCG and Affine cipher?
deleted 22 characters in body
Nov
29
comment Implementation specific differences between RDRAND and RDSEED
Are you sure that there is a statistically significant difference between RDSEED and RDRAND in those randomness tests? That seems very unlikely to me.
Nov
28
answered How can there be AES-256-GCM, when GCM is defined for 128-sized blocks?
Nov
28
revised Which hash function is usually used in RSA?
edited tags