Linked Questions

6
votes
4answers
772 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
4answers
796 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 ...
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 ...
10
votes
3answers
2k 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 ...
5
votes
3answers
1k 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 ...
4
votes
3answers
2k views

How likely is a AES KDF bypass?

So I was wondering about some alternative attack scenario which I thought of when I started to understand KDF's . So lets say you have a cipher like AES and a strong KDF . And the legit user uses a ...
2
votes
3answers
958 views

How much processing power should you assume an attacker has?

The answer to this question says that you should assume an attacker can do one billion operations per second: Key Size for Symmetric Homomorphic Encryption Over the Integers Is that a single attacker ...
16
votes
2answers
53k 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 ...
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 ...
13
votes
2answers
19k 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
4
votes
2answers
72 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'...
4
votes
2answers
7k views

Algorithm for generating OAuth tokens

I'm trying to find a good algorithm for generating authorization codes, access tokens and refresh tokens in an API. Currently, I am looking into the following setup: Tokens are generated using the <...
4
votes
2answers
11k views

ECDSA with SHA256 and sepc192r1 curve: Impossible, or how to calculate $e$?

I need to use ECDSA as the signing algorithm and SHA256 for hashing the message. I'm running into troubles verifying the signature calculated on two different platform (one is BouncyCastle, another ...
3
votes
2answers
355 views

can a weak cipher in a cascade weaken the result?

So i am a real beginner . And I use AES(TWOFISH(Serpent))) for my veracrypt file . So I asked myselfe a Question : When a Cascade is made the Key is split in parts for each algorythm . So if We ...
3
votes
2answers
249 views

Recovering key in AES - Infinitely many known plaintext ciphertext pairs

Is it possible to recover key/algorithm in AES encryption more efficiently than via brute force given attacker has access to arbitrarily many plaintext ciphertext pairs. If so, are there other known ...

15 30 50 per page