Reputation
962
Top tag
Next privilege 1,000 Rep.
Edit questions and answers
Badges
7 11
Newest
 Yearling
Impact
~38k people reached

  • 0 posts edited
  • 0 helpful flags
  • 13 votes cast
Jun
12
answered Definition of indistinguishable schemes
Jun
12
asked Can we reduce Diffie-Hellman problem to “Discrete-log inversion” problem?
Oct
30
asked Public key encryption without ciphertext expansion
Dec
20
answered Diffie-Hellman insecure on addition modulo $n$
Jan
9
asked How secure is the knapsack?
Oct
11
asked Why has the RSA factoring challenge been withdrawn?
Sep
28
answered For Diffie-Hellman, must g be a generator?
Sep
28
answered How does one calculate a primitive root for Diffie-Hellman?
Sep
27
answered In RSA, do I calculate d from e or e from d?
Sep
27
answered Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Sep
27
answered What is the difference between a stream cipher and a one-time-pad?
Sep
27
answered Is Diffie-Hellman mathematically the same as RSA?
Sep
27
answered Why isn't the IND-CCA property inherited when sending redundant ciphertext?
Sep
26
asked Need an introduction to SPKI (or “SPKI for dummies”)
Jul
16
asked Reduction from signatures to encryption?
Jul
16
answered advances in usability for cryptography/authentication
Jul
14
answered Current mathematics theory used in cryptography/coding theory
Jul
14
answered RSA with small exponents?
Jul
12
answered Why use a 1-2 Oblivious Transfer instead of a 1 out of n Oblivious Transfer?
Jul
12
answered What is the general justification for the hardness of finding preimages for cryptographic hash functions?