Skip to main content

Questions tagged [brute-force-attack]

A brute-force attack is attempting to find a secret value by trying all possible values until the correct one is found.

4 votes
1 answer
259 views

Adversaries got hold of a database of password hashes. They want to find the password for at least one of the hash. They'll try $k$ passwords on each of $h$ hashes. We assume they know enough about ...
fgrieu's user avatar
  • 151k
3 votes
2 answers
675 views

Can an adversary invert some rounds of ChaCha20 (or ChaCha12) to obtain the internal state of a specific round? I mean, if an adversary can invert 12 rounds of ChaCha20 to obtain the internal state of ...
przemyslawo's user avatar
0 votes
1 answer
72 views

I am wondering if it is possible to find a K that decrypts a chosen ciphertext C into a chosen plaintext P in Camellia 128 ECB-mode? We can assume that there is no IV. There will exist some K that ...
ucker's user avatar
  • 1
2 votes
0 answers
96 views

Even though this sounds hardware related, it's essential to understand the actual security one obtains from memory hard key derivation functions, such as Balloon, as its strongest security guarantee ...
caveman's user avatar
  • 721
1 vote
1 answer
89 views

Balloon's theorem says: Questions: Am I understanding the variables correctly? $n$ is number of blocks the user chooses. $r$ is number of rounds the user chooses. $\delta$ is number of pseudorandom ...
caveman's user avatar
  • 721
5 votes
4 answers
294 views

I mean, in a pragmatic sense, in terms of a brute-force difficulty. For example, if I have a random key accumulating $N$ bits of entropy, I’d expect to brute-force it in the order of $2^N$ trials. It ...
uk-ny's user avatar
  • 187
2 votes
0 answers
60 views

Current memory hard key derivation techniques rely on functions that allow for serialisation on tiny memory, except for requiring a quadratic time penalty. But, with Quantum's light-speed defying ...
caveman's user avatar
  • 721
2 votes
1 answer
184 views

Stock 7-Zip AES-256 encryption runs your password through a hash function 524,288 times ($2^{19}$). Source 1 Source 2 This is considered to be Not very good compared to a standard amount of Argon2 or ...
user125888's user avatar
2 votes
1 answer
88 views

I am aware that cross posting isn't typically allowed on SE but I think this question, earlier posted on math SE, is worth considering on crypto SE. (Since this post is just a copy of math SE question ...
esteregg's user avatar
0 votes
1 answer
122 views

At least his verbal description, as if I had searched the entire Internet, but I never found it. I want to try to crack the hash by brute force, and for this you need to have this algorithm at hand? I ...
Minislamov's user avatar
0 votes
0 answers
72 views

I've been reading about the security implications of quantum computing on cryptographic algorithms and came across some discussions regarding SHA-256. I understand that SHA-256 is currently considered ...
Nerses Asaturyan's user avatar
0 votes
1 answer
98 views

Let's assume that the password to be cracked is 15 characters long and consists of numbers (to keep the math simple). Let's assume the attacker has the following information about the password: It is ...
randomguy's user avatar
1 vote
1 answer
342 views

Let a plain text message M be DES encrypted with two different keys (K1 and K2) to produce ...
Jib's user avatar
  • 113
5 votes
1 answer
3k views

Given the following two preconditions: It is almost impossible to reconstruct a bitcoin private key if an attacker only has one half of the private key as well as the public key. It is almost ...
Ohumeronen's user avatar
-1 votes
1 answer
256 views

Decrypting an AES-Encrypted Message Without the Key: A Cryptographic Challenge Summary: I am investigating the possibility of decrypting an AES-encrypted message when the encryption key is unknown ...
NeoX's user avatar
  • 1

15 30 50 per page
1
2 3 4 5
24