Reputation
12,269
Next tag badge:
90/100 score
20/20 answers
Badges
1 31 61
Newest
 Enlightened
Impact
~211k people reached

Dec
12
comment Decrypt all RSA ciphertexts if you can break 1% of them
Do we have a duplicate of this question? I thought I already read an equivalent question, but couldn't find it.
Dec
12
answered Decrypt all RSA ciphertexts if you can break 1% of them
Dec
11
comment Probability of factoring keys as a function of bit length
Similar question: How many RSA keys before a collision?
Dec
11
revised rotational cryptanalysis on modulo multiplication?
edited tags
Dec
11
comment RSA or Paillier is good?
I suspect you have a misunderstanding about what homomorphic encryption with RSA or Paillier achieves. Encrypting files like that is almost certainly not useful.
Dec
11
revised 2048-bit RSA Decryption
rolled back to a previous revision
Dec
9
comment Is a strong block cipher usable as a strong sponge function?
What's a bit annoying here is that you need to make relatively strong assumptions about the block cipher, not just that it's a PRP.
Dec
8
awarded  Popular Question
Dec
5
comment Is there (this) a case in which salting is dispensable?
Salting prevents many multi-target attacks, not just rainbow tables.
Dec
5
revised Initialize the eight working variables SHA256
edited tags
Dec
4
revised Will X9.31 remain a secure & acceptable deterministic random generator beyond 2015?
added 9 characters in body
Dec
4
comment SHA1 - SSL/TLS Cipher Suite
@crypto-learner The attacker would get the CA to look the harmless looking one of the colliding pair and then use the malicious one with the same signature.
Dec
4
revised Using machine-learning techniques for data-dependent operations in ciphers
added 2 characters in body
Dec
4
reviewed Edit Point decompression on an elliptic curve
Dec
4
revised Point decompression on an elliptic curve
improving formatting, typos
Dec
3
comment Is this problem based on a known hard problem?
I have never seen a meaningful reduction to knapsack. There are almost always issues around asymptotic vs concrete security and average vs worst case. I wouldn't not use anything knapsack based in practice.
Dec
3
answered I don't care about replay attacks. What should I do with the nonce in nacl?
Dec
2
comment Repeating something encrypted and non-encrypted?
As long as your encryption is secure know plaintexts don't help the attacker.
Dec
2
comment Does Ed25519 support cryptographic threshold signatures?
There is always the generic solution: A public key is the concatenation of n individual public keys and the threshold m, a signature is the concatenation of m individual signatures.
Dec
2
revised Does Ed25519 support cryptographic threshold signatures?
added 147 characters in body