Linked Questions

0
votes
0answers
39 views

Can we bound adversarial power in terms of total entropy in universe? [duplicate]

The strengths of various cryptographic primitives are often explained (though not defined) in terms of how long it would take to break under the current best known attacks. For example, apparently the ...
39
votes
10answers
10k 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 ...
42
votes
6answers
32k views

Why is AES resistant to known-plaintext attacks?

At least it's my understanding that AES isn't affected by known-plaintext. Is it immune to such an attack, or just resistant? Does this vary for chosen-plaintext?
29
votes
3answers
4k views

Dropbox Password security

Dropbox have recently published How Dropbox securely stores your passwords Is this really more secure than using bcrypt with a complexity of 11 or 12 ? The password "chain" is secure as its weakest ...
15
votes
4answers
20k views

Is password-based AES encryption secure at all?

For a few years I have put all my passwords in a text file and encrypted that file with a password using a software solution (Axcrypt) which uses AES-128. The password is not really strong, but I ...
15
votes
2answers
3k 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 ...
11
votes
2answers
17k views

Does SHA-1024 hash exist?

Does SHA-1024 cryptographic hash function exist similarly to SHA-512? If not, what's the reason for that? Links: SHA-2 at Wikipedia SHA-3 at Wikipedia
10
votes
3answers
1k views

1 Billion Bit Encryption?

So, browsing through YouTube, I stumbled on this video interview of John Draper (Captain Crunch), one of the first "hackers". He talks for about 3 minutes (until 27:48) about his home rolled ...
2
votes
4answers
660 views

Why can't we give block ciphers larger keys?

I have limited math's knowledge so sorry if this question sounds stupid. I saw many people complaining about AES, Twofish and Serpent that these ciphers all could be crackable in the near future and ...
14
votes
2answers
48k views

Twofish vs. Serpent vs. AES (or a combo)

I've seen some posts and info online, but they are from 2009, 2010, 2011 or 2012, which is 3-6 years ago, which is a very long time. So I'm looking for an up-to-date answer about which of these is the ...
5
votes
4answers
24k views

How long would it take to brute force an AES-128 key?

How long would it take to crack a AES-128 key using the most advanced technology currently available? The hardware can be anything, be it a high-performance CPU, GPU or even FPGA?
15
votes
4answers
2k views

How is the quality of a password calculated and what does it mean?

While using Keepass and using it to generate random passwords, I always have noticed the "quality" section but truthfully have never known what it actually means. So my questions are; How much ...
10
votes
5answers
2k views

What is the most secure ECC Curve?

I have for a while used Koblitz curve (sect571k1), in ECDH and ECDSA. But I have started wonder if it is the most secure. I prefer security over efficiency. So the curve doesn't have to be the most ...
6
votes
4answers
715 views

Is there a proof for showing any cryptogram is crackable?

I commonly hear statements along the lines of "all cryptograms are crackable - it's only a matter of time". Is there a proof to show that any cryptogram is "crackable"? The proof may be of a more ...
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. ...

15 30 50 per page