# Linked Questions

2answers
132 views

### Is there a way of increasing the time to brute force a cipher, but by increasing the ciphertext size instead of the key size?

If you have a symmetric-key algorithm that is limited to using a small key size (say 40-bits) is there any way you could increase the resistance to brute force attacks without increasing the key size? ...
0answers
279 views

### What is the danger if a non-prime is chosen for RSA? [duplicate]

I was reading this question about generating primes for RSA keys. The answers point out that most implementations of of the algorithm use probabilistic prime-ness checking algorithms. The answer by @...
2answers
68 views

### Does a thermodynamic limit on key search apply to quantum computers?

There is (or at least was) a thermodynamic reasoning that any form of brute force key search would require an energy at least $k\,T$ per key tested, where $k$ is Boltzman's constant and $T$ the device'...
1answer
80 views

### Maximum security strength in bits of ISAAC cipher?

Wikipedia claims key length can be very big in this cipher, so I assume it can offer a million bits of security provided entropy of key is the same? Of course I can SHA-256 hash the key to allow any ...
1answer
72 views

### Indeterminate Message Validity as a Noise Source in High Volume Channels

Question Rephrased: Does randomisation of valid and invalid messages in a high volume channel add security? Scheme: valid messages are identified by a pre-shared random number sequence and noise- ...
1answer
63 views

### Key generation algorithm based on bytes in a drive [closed]

I am a novice cyber security student and thought of a way to generate a random cryptographic key. The algorithm works as follows: Get the size (in bytes) of every file in a directory (drills down ...
1answer
31 views

### Vulnerability of low value generated key

I have read here that Elgamal is resistant to brute-force attack, because the group to where the key is selected is very large. But since the key generation is random, (i assume)there is a chance that ...

15 30 50 per page