Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our questions

38 votes
1 answer
2k views

Who first published the interest of more than two prime factors in RSA?

3 votes
1 answer
41 views

Cost of attacking textbook RSA signature of $b$-bit hash of the message

4 votes
2 answers
193 views

Signature check decrypts ciphertext

0 votes
0 answers
201 views

RSA : Is there a way to compute phi(n) or N itself if we only know e, d and a ciphertext?

2 votes
1 answer
358 views

Crack RSA with $e$ and $d$?

2 votes
1 answer
2k views

Decrypting Multi-Prime RSA with e, N, and factors of N given

1 vote
1 answer
631 views

Factoring $n$ in RSA knowing $e$ and $d$

3 votes
1 answer
69 views

What is the modern terminology for a digital signature scheme with a shadow?

1 vote
1 answer
81 views

Textbook RSA security for fully random message

1 vote
1 answer
26 views

NIZK Proof of Knowledge of a Standard RSA Signature on a message (without signer participation)

2 votes
1 answer
67 views

Why is $d = e^{-1} \mod \phi(N) \equiv e^{\phi(N)-1} \mod \phi(N)$ and not commonly used in RSA key generation?

3 votes
1 answer
515 views

Confusion over PKCS#1 and "traditional" options with OpenSSL

4 votes
3 answers
6k views

Openssl & RSA : how many public exponents are possible?

3 votes
1 answer
230 views

Time Complexity of RSA Trial Division

Browse more Questions