Reputation
21,859
Next tag badge:
98/100 score
23/20 answers
Badges
4 29 79
Impact
~465k people reached

Apr
16
comment Are there any elliptic curve asymmetric encryption algorithms?
Those are all good schemes, but doesn't the question ask for encryption to be fast like in RSA? Do any of these schemes support encryption that is as fast as RSA's encryption? As far as I can tell, none of them are -- have I misunderstood? I think there's a tradeoff: RSA encryption will be faster than the ECC schemes; the ECC schemes will be faster for everything else, and will have shorter keys.
Apr
15
revised Are AES-256's related-key weaknesses exploitable if it is used to build a hash?
added 139 characters in body
Apr
14
comment In Pedersen Key Distribution, can the public key be persistent?
Are you saying there is an attack if you re-use $(p,g,h)$ too many times? Are you saying that existing proofs don't make any promises if you re-use $(p,g,h)$ too many times? Can you give some intuition for what the nature of the alleged trouble is? I find it hard to believe that there is a real problem. It is bog-standard to re-use the public key $(p,g,h)$ in discrete-log-based cryptosystems; is there any reason that Pederson would be different?
Apr
14
answered Are AES-256's related-key weaknesses exploitable if it is used to build a hash?
Apr
13
reviewed Edit knapsack tag wiki
Apr
13
revised knapsack wiki description
deleted 151 characters in body
Apr
13
reviewed Reject knapsack tag wiki excerpt
Apr
11
answered How do I express each element in a field F as a power of a primitive element?
Apr
7
comment How could Fully Homomorphic Encryption support power operations?
My perspective: The answer says that XOR and AND are universal, and thus any operation, including addition and multiplication, can be built out of XOR and AND gates. That is a correct statement. So the answer seems fine to me. But we can agree to disagree (or have a slightly different reaction) -- nothing wrong with that!
Apr
7
comment How could Fully Homomorphic Encryption support power operations?
@poncho, I don't understand your comment. This answer looks correct to me. The answer never says "ADD==XOR", does it? XOR and AND are universal; no need for NAND.
Apr
7
comment How could Fully Homomorphic Encryption support power operations?
You already answered your own question. "It enables arbitrary functions..." Power is a function.
Apr
7
comment Is it possible to determine or estimate the period for Blum-Micali PRG?
The premise seems faulty. Cycles can occur even if there is no fixed point. So, focusing on fixed points seems mis-placed, if you really care about cycles. But, as I explain in my answer, worrying about short cycles is also mis-placed concern.
Apr
7
answered Is it possible to determine or estimate the period for Blum-Micali PRG?
Apr
6
reviewed Reject Wrong Test Vector for HKDF with HMAC-SHA256
Apr
6
comment Wrong Test Vector for HKDF with HMAC-SHA256
This question appears to be off-topic because it is about software development (try StackOverflow).
Apr
5
awarded  Favorite Question
Apr
5
comment Should we MAC-then-encrypt or encrypt-then-MAC?
I edited the answer to more clearly express the point Josef was trying to make. Personally, I think the answer is fine (I upvoted it).
Apr
5
revised Random oracle model proofs and programmability
Improve the title & question a bit.
Apr
5
reviewed Reject Random oracle model proofs and programmability
Apr
4
revised Should we MAC-then-encrypt or encrypt-then-MAC?
added 448 characters in body