User Jus12 - Cryptography Stack Exchange

Jus12

Member for 12 years, 4 months
Last seen more than 1 year ago

GitHub

17 Answers

Score Activity Newest

13 votes

What is the general justification for the hardness of finding preimages for cryptographic hash functions?

answered Jul 12, 2011 at 20:04

13 votes

Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?

answered Sep 27, 2011 at 20:22

8 votes

Is Diffie-Hellman mathematically the same as RSA?

answered Sep 27, 2011 at 19:44

8 votes

Why use a 1-2 Oblivious Transfer instead of a 1 out of n Oblivious Transfer?

answered Jul 12, 2011 at 20:14

8 votes

advances in usability for cryptography/authentication

answered Jul 16, 2011 at 17:51

7 votes

How does one calculate a primitive root for Diffie-Hellman?

answered Sep 28, 2011 at 7:44

6 votes

For Diffie-Hellman, must g be a generator?

answered Sep 28, 2011 at 12:30

5 votes

Diffie-Hellman insecure on addition modulo $n$

answered Dec 20, 2013 at 4:30

5 votes

In RSA, do I calculate d from e or e from d?

answered Sep 27, 2011 at 20:46

4 votes

What is the difference between a stream cipher and a one-time-pad?

answered Sep 27, 2011 at 19:57

4 votes

Current mathematics theory used in cryptography/coding theory

answered Jul 14, 2011 at 7:30

3 votes

Why isn't the IND-CCA property inherited when sending redundant ciphertext?

answered Sep 27, 2011 at 8:54

2 votes

RSA with small exponents?

answered Jul 14, 2011 at 6:27

2 votes

request for data to test deterministic ecdsa signature algorithm for secp256k1

answered Dec 25, 2017 at 11:29

1 vote

Defining Symmetric vs Asymmetric cryptosystems

answered Jan 15, 2016 at 5:04

0 votes

Proving the possession of signature in zero-knowledge

answered Dec 30, 2016 at 6:40

0 votes

Definition of indistinguishable schemes

answered Jun 12, 2015 at 19:26