Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

Explore our questions

0 votes
1 answer
130 views

Is there a benefit in cryptography to return 0 in square and mutliply algorithm when a modulo is 0?

0 votes
1 answer
101 views

Looking for a modifiable signature!

2 votes
1 answer
554 views

How could a 1024‒bits RSA modulus be most economically factored within months today?

10 votes
3 answers
3k views

How to better generate large primes: sieving and then random picking or random picking and then checking?

-1 votes
1 answer
98 views

RSA small private key attack: the private key is slightly larger than the bound given by Boneh and Durfee

0 votes
0 answers
58 views

rsa special private key attack

3 votes
1 answer
473 views

How vulnerable is RSA when using it to encode ~1000s of datasets with 500bytes each? How easy can the private key passphrase be hacked?

2 votes
1 answer
141 views

Prove with ZKP that I have encrypted a message $v + random\_number\cdot c$ given an RSA public key?

1 vote
1 answer
76 views

Shannon's Perfect Security for Asymmetric Encryption

6 votes
3 answers
4k views

Why does it take longer to generate suitably large primes for Diffie-Hellman key exchange as opposed to for RSA encryption / decryption?

35 votes
5 answers
86k views

Why is padding used for RSA encryption given that it is not a block cipher?

1 vote
1 answer
28 views

What is the best possible security for authentication of entity?

1 vote
1 answer
100 views

Digital Signature and Encryption Process / Hierarchy

19 votes
3 answers
38k views

What makes RSA secure by using prime numbers?

Browse more Questions