Cryptography Stack Exchange

38 votes

1 answer

2k views

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

fgrieu♦

132k

modified 21 hours ago

3 votes

1 answer

41 views

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

Daniel S

18.3k

modified Mar 26 at 11:04

4 votes

2 answers

193 views

Signature check decrypts ciphertext

fgrieu♦

132k

modified Mar 24 at 3:05

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?

CommunityBot

1

modified Mar 22 at 9:18

2 votes

1 answer

358 views

Crack RSA with $e$ and $d$?

fgrieu♦

132k

modified Mar 21 at 7:14

2 votes

1 answer

2k views

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

user108420

1

modified Mar 20 at 2:05

1 vote

1 answer

631 views

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

swineone

518

modified Mar 19 at 16:58

3 votes

1 answer

69 views

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

fgrieu♦

132k

modified Mar 17 at 7:15

1 vote

1 answer

81 views

Textbook RSA security for fully random message

Maarten Bodewes♦

89.2k

answered Mar 17 at 3:34

1 vote

1 answer

26 views

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

Ethan Heilman

2,236

modified Mar 16 at 21:13

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?

poncho

139k

modified Mar 16 at 14:15

3 votes

1 answer

515 views

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

Maarten Bodewes♦

89.2k

modified Mar 13 at 16:55

4 votes

3 answers

6k views

Openssl & RSA : how many public exponents are possible?

Krzysztof Cichocki

93

modified Mar 13 at 13:01

3 votes

1 answer

230 views

Time Complexity of RSA Trial Division

Maarten Bodewes♦

89.2k

modified Mar 12 at 6:08

Stack Exchange Network

Explore our questions

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

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

Signature check decrypts ciphertext

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

Crack RSA with $e$ and $d$?

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

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

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

Textbook RSA security for fully random message

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

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

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

Openssl & RSA : how many public exponents are possible?

Time Complexity of RSA Trial Division

Hot Network Questions