Linked Questions

0
votes
0answers
226 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 @...
3
votes
2answers
56 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'...
1
vote
1answer
68 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- ...
0
votes
1answer
61 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 ...
1
vote
0answers
43 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 ...

15 30 50 per page