Tagged Questions
0
votes
0answers
53 views
how many bit flips current computers can carry per second? When brute force is hard?
How many bit flips the fastest current computers can accomplish per time unit? i.e per second. I am trying to find when brute force attacks are considered infeasible. The reason I chose bit flips is ...
4
votes
1answer
136 views
Question about why RSA is hard to attack
I think I understand why RSA is hard to attack but I'd like to get clarification if I actually do.
Assume there are two people, Alice and Bob, who are attempting to communicate privately but that we ...
1
vote
1answer
118 views
Generate an insecure public / private key pair
I am looking for a way to generate an "insecure" public key pair. and by insecure I actually mean a pair that is breakable using brute-force (or other encryption) methods.
As far as I know PGP ...
2
votes
1answer
272 views
Why can't I break ElGamal encryption by brute-forcing the secret exponent?
I am doing a course on cryptography on coursera and one of the topics covered was the ElGamal Encryption system.
I am using the terms as defined in Wikipedia.
Alice publishes $g$ and $g^x$. ...
2
votes
2answers
949 views
How much computing resource is required to brute-force RSA?
It's been over 30 years since Rivest, Shamir and Adleman first publicly described their algorithm for public-key cryptography; and the intelligence community is thought to have known about it for ...
3
votes
2answers
244 views
Key space size when either of two public keys are valid for authentication?
If for authentication a user can own either A OR B public key instead of just one specific key is that equivalent to halving the key space. i.e. it it theoretically twice as easy to brute force and ...
3
votes
2answers
515 views
Can a computationally unbounded adversary break any public-key encryption scheme?
Assume there is a public-key encryption scheme $(KeyGen, Enc, Dec)$ with perfect correctness (i.e., for all messages M and valid key-pairs (PK,SK), we have $Dec_{SK}(Enc_{PK}(M))=M$).
Will there ...
