Linked Questions

6
votes
4answers
2k views

Suppose I capture encrypted data that I want to decrypt. Could I use a server farm to decrypt?

For argument's sake, let's say that I'm a bad actor who produces malware. I've infected around 10,000 computers and smartphones with my malware, which runs in the background and can be used to make ...
0
votes
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 ...
2
votes
1answer
77 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 ...
1
vote
1answer
182 views

Encryption using matrix transformations

I have been thinking lately about a block cipher which takes a block of bits and arranges them in a square matrix. Then defining transforms on submatrices of the square matrix to scramble the bits. ...
4
votes
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'...
2
votes
2answers
1k views

Is this test result sufficient to steer clear from this RNG for cryptographic applications?

I'm not really interested in this PRNG. I'm more interested in understanding what it takes to fail the security threshold for cryptographic applications. I'm taking the C PRNG as an example. ...
40
votes
10answers
11k views

Differences between industrial and military cryptography

Industrial and military cryptography should follow the same basic rules, but what does make them different is: Higher key length, protocols unknown to the civilian world, and perhaps unique methods ...
14
votes
2answers
4k views

Calculate all possible keys for AES 128 encryption to exploit hardware encryption

Some background: I am using the MicroChip ATAES132a for hardware encryption/decryption. The ATAES132a is very configurable and can be misconfigured in such a way that the encryption/decryption will be ...
7
votes
1answer
2k views

Is the cipher “Kalyna” with a 512-bit key length more secure AES with a 256-bit key?

Recently I have found out that Ukraine has its own symmetric encryption algorithm "Kalyna". Developers of this algorithm said that their algorithm is more secure than AES because of longer key length ...
2
votes
1answer
539 views

Is there a truly safe signing algorithm?

After reading this question, I'm pretty shaken up. A determined attacker with $100 in loose change can crack any RSA key in a couple of hours. After believing that these algorithms would take millions ...
0
votes
2answers
1k views

How to calculate a private key from public key on elliptic curve? [duplicate]

Provided, that you have to multiply a well known G by the private key to obtain the public key, why not keep adding G to itself until you reach the public key. The private key should be the number of ...
-4
votes
1answer
2k views

Is AES256 the most secure encryption algorithm available at the moment? [closed]

I have had to edit this question because it was too broad (sorry didn't realise that was not allowed...), so, lets go with: Is AES256 the most secure encryption algorithm available at the moment? If ...
0
votes
1answer
304 views

Perfect secrecy of block ciphers

Is it right that all block ciphers don't provide perfect secrecy like AES? If it's true, how can we prove that? If it's not true can you tell me a sample? Any reference or guidance would be ...
4
votes
3answers
961 views

How confident can we be that nobody will crack a 128-bit key?

In a context involving a block cipher like AES-128, excluding quantum computers, cryptanalytic breakthrough on AES and implementation attacks (poor TRNG, DPA..), and wrench, how confident can we be ...
2
votes
2answers
798 views

Diffie-Hellman key exchange - why is modulo operation necessary?

Could someone explain why it's necessary to have the modulo operation in the Diffie-Hellman key exchange? Let's imagine we do DH without the modulo operation ($A = g^a, B = g^b$). Would that not work,...

15 30 50 per page