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.

Filter by
Sorted by
Tagged with
-2
votes
0answers
19 views

Another way to brute force values and store them in arrays [closed]

I would like to do something like this with a brute force script. i would like to brute force a range of numbers. For example a number from 0 to 19 where any brute forced number in the array 0 to 19 ...
2
votes
1answer
99 views

How long would it take to brute force a 32 or 16 bit integer and which type of processor would brute force this in the shortest period of time

I was actually wondering... How long would it take to crack/brute force a 32 bit key/encryption and a 16 bit key/encryptions respectively on a 4GHZ and a 2GHZ PC. I know that a 32 bit integer has 4,...
0
votes
2answers
90 views

Is RSA secure enough to protect bitcoin private keys? [duplicate]

Suppose my very trusting friend has a bitcoin private key with a large balance (let's say $1B USD worth of Bitcoin) and wishes to keep a backup copy with me as a trustee. He doesn't want to transfer ...
1
vote
1answer
56 views

When attacking keyed algorithms, how is it known when the output is correct?

I've been reading a little bit about cryptanalysis, and I'm wondering how attacking algorithms that work on keys is performed. It's obvious how algorithms like MD5 are attacked, in pseudocode: ...
0
votes
0answers
38 views

Brute-forcing a PGPDisk (.PGD) encrypted file

I have some ~20 year old PGPDisk (.PGD) files for which I have long since lost the keys and/or passwords. I've written some GPU accelerated brute-forcing for OpenOffice / PBKDF2 in the past, so I ...
0
votes
0answers
36 views

How many repetition in Ciphertext-Only-Attack?

Given the following algorithm, how many times do I need to repeat step 2&3 to complete the attack? Please note that block size and key are 128 bits. Step1: Prepare set S of size 2^k which contains ...
1
vote
1answer
117 views

Brute Force on Curve25519

I was thinking about a brute force attack on Curve25519. For this, we need to solve the discrete Logarithm problem $P = [n]Q \bmod 2^{255} - 19$. $P$ and $Q$ are known Points on the elliptic curve, so ...
-1
votes
1answer
60 views

Bruteforce attack on a 64bit computer [duplicate]

How would I attempt to brute force a RSA encrypted message with a 64bit computer if it the memory can't put up with calculations bigger than 64bit? Without going that far to attempting to crack it, ...
0
votes
2answers
58 views

Logarithmic brute-force for stream-ciphers

First of all, I want to make sure I understand stream ciphers correctly: I put a plainchar (e.g. byte?) through the stream cipher and receive a cipherchar. Correct? When I now have a pair of ...
1
vote
2answers
132 views

Secret sharing scheme WITHOUT Shamir Secrete Sharing

I am planning to use the following XOR scheme to divide a secret into only 2 shares (I do not want to use Shamir Secret Sharing for different reasons that are beyond the scope of this post). Here's ...
0
votes
1answer
238 views

Time taken for Brute Force Attack on DES

An attacker is equipped with a computer that performs 10 trillion (1013) DES decryptions per second, what is the average time required, in hours, for a brute force attacker to break DES? Key size is ...
1
vote
1answer
110 views

What is the current security level of an algorithm?

I was reading a paper of some years ago about a cryptography and a phrase got my attention. We want to ensure a security level of at least $2^{80}$ I know that $2^{80}$ was used as rule of thumb ...
0
votes
1answer
31 views

How to measure brute force speed of a computer for a give cipher with given number of keys for second for a given key space

As I understood brute force attack is measured in number of keys which in turns give time required based on speed of computer It is quite interesting find out how effective an arbitrary computer is ...
0
votes
0answers
76 views

Argon2id benchmarks

Recently I've decided to publish a simple app that I am using for maintaining and storing sensible encrypted data on the cloud. https://www.microsoft.com/store/apps/9NSGBQSJ2HD6 The hashing is done ...
0
votes
1answer
52 views

Probability for success of exhaustive search on PRF keys

I saw this example for exhaustive search to break the security of a PRF $F_k:\{0,1\}^n\times\{0,1\}^n\rightarrow\{0,1\}$ where the key space is of size $|\mathcal{K}|=2^n$. The claim is that there is ...
0
votes
0answers
193 views

How to bruteforce password from HMAC-SHA256 hash (if you have the key)?

Short of creating one's own script / program, is there an existing, readily available way of iterating through a list of potential passwords to find which one corresponds to a hash (HMAC-SHA256), ...
5
votes
6answers
5k views

Are longer passwords really safer against brute force attacks?

If we take two password strings of different length and attempt to bruteforce match them, it is obvious that the longer one will take longer to crack on average. However if we assume that when ...
0
votes
2answers
61 views

Is a larger block size less secure against a brute-force known cipertext attack?

Suppose a ciphertext $c$ was encrypted from plaintext $m$, and we know something about the form of $m$; say, for example, that $m$ is English text. We can attempt to brute-force $m$ from $c$ by ...
4
votes
1answer
276 views

Is double encryption really a bad idea? Are meet-in-the-middle attacks practical at all?

Meet-in-the-middle attacks are used to justify that attacks on ECC and double encryption will have complexity of $O(\sqrt{n})$ for ECC and $O(2^{n+1})$ for double encryption complexity instead of $O(n)...
2
votes
1answer
318 views

Msieve & Yafu - RSA Exponents and bruteforcing

I am a layman in regards to the math behind RSA (and in general, relatively), and my goal is to bruteforce a large quantity of 512-bit RSA keys. Having searched around, I see that msieve, yafu, and an ...
1
vote
1answer
62 views

Any known cases of lucky collisions resulting in security breaches?

This isn't a deep technical question, but I feel like this is a good place to ask. Modern cryptography generally rely on statistical chances of collisions according to current computing powers. Are ...
1
vote
1answer
253 views

Complexity of a brute-force search

I am currently thinking about the complexity of a brute-force attack on a cipher. Let the key length of the cipher be 64 bit. Then there are $2^{64}$ different keys in the keyspace. If you do a brute-...
8
votes
1answer
829 views

Security levels in NIST Post-quantum project: e.g. AES-128 vs SHA-256

In an article about NIST Post-quantum Standardization project I read about the security criteria of the proposed schemes and there was this table (Level I lowest security, level V highest): Level I: ...
1
vote
1answer
71 views

Is it possible to narrow down the possible keys used for AES CBC encryption, knowing a given plaintext and its ciphertext, where IV=0? [duplicate]

I'm brute forcing a ciphertext with a given dictionary to figure out which key was used. However, it's been hinted at that there is a way to narrow down the dictionary to a smaller subset of ...
1
vote
1answer
224 views

Estimate password cracking time given Shannon Entropy

Is there some algorithm that, given the Shannon entropy of a string, compute an estimation of the time that an average home computer will take to crack the password? Thank you.
0
votes
1answer
37 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 ...
0
votes
1answer
107 views

Security implications of using a high entropy password with a low iteration count for a key derivation function

This question is related to my other question, but also this entropy calculation question as well as this article about PBKDF2. It may also be considered as a duplicate of this question, although in ...
2
votes
2answers
56 views

How to protect against brute force attacks in the case of a small dictionary?

Sorry if I'm not using the right terminology, as I'm new to crypto. I want to know the most effective way to protect a database against brute force attacks in the case of a small dictionary. For ...
1
vote
4answers
997 views

How is PBKDF2 so much better than normal Hashing or even using HMAC

I do not know how the Key Length extension attack works. So if we leave that aside for once, and say just about usual brute-force attack on the hash, I don't really know how is PBKDF2 so much better ...
2
votes
4answers
218 views

Is an invulnerable code possible (including brute force attack)?

If I double encrypted a text with for example AES wouldn't it be invulnerable to bruteforce attacks due to the computer not knowing when it has reached the plain text? Plain text->1st layer of ...
4
votes
2answers
2k views

Why this brute force attack doesn't reduce all cryptographic hash functions' security bits against collision attacks to N/3?

The traditional brute force collision attack is generate $2^{N/2}$ (unique) random strings, hash them and this results in ~50% chance for collision. The attack talked in the question's title is ...
0
votes
1answer
92 views

Would it be easier to bruteforce the original data if given two hashes (from different hash functions)? [closed]

I have a chat server which uses public keys to identify their clients. But if the public key is known, then everyone can send a direct message (DM) to each other, which is annoying. The clients should ...
0
votes
1answer
189 views

Bitcoin mining nonce and birthday attack

Having read the basics of mining and this about SHA256 (probabilistic?) partial preimage possible? and SAT solving - An alternative to brute force bitcoin mining, I have the following question: ...
1
vote
1answer
59 views

Simplifying Meet-In-The-Middle Attacks

Considering the fact that a block cipher is a bijective function on the set of possible plaintexts, if one views the encryption of a datum with a key $K_2$, which has been already encrypted with the ...
1
vote
0answers
58 views

Can $AES_{k1}(m)$ be equal to $AES_{k2}(m)$? [duplicate]

Context: We have a generic bloc cipher composed of an encryption function $E_k$ and a decryption function $D_k$ operating on blocs of $n$ bits. For a key $k$ fixed, we can see $E_k$ as a pseudo-...
0
votes
2answers
2k views

19 out of 24 words of BIP39 passphrase (brute-force last 5?)

I have managed to lose 5 words of my 24 word Ledger Nano S recovery phrase. I have words 1-19 but I am missing words 20-24. I have significant holdings on the wallet so would very much like to recover ...
4
votes
1answer
105 views

The small key-search circuit for brute-force of Bernstein

I'm trying to understand Understanding brute force by Bernstein. I couldn't understand how the described machine can brute force the AES. The attacker builds a very small key-search circuit. The ...
3
votes
1answer
49 views

How to get a speedup linear in the number of iterations on unsalted iterated password hashing?

In their 2015 paper "More Rounds, Less Security?" Guo, Jean, Mouha and Nikolić claim in section 5.4 that one can recover a password $P$ given hashes of $D$ different passwords generated from $H^k(P)$ ...
2
votes
1answer
171 views

Attack on a Feistel Cipher given the key and half of the ciphertext

Consider a classical Feistel Cipher, with the round functions given and the keys used in the ciphering process. Is it possible to reconstruct the original data if half of the ciphered text is given? ...
1
vote
1answer
119 views

Comparing Shanks' Algorithm to Brute Force

I'm trying to understand how/why Shanks' algorithm solves the discrete log problem $y=g^x \bmod p$ faster than a brute force search does. Any explanation would be great.
0
votes
0answers
225 views

Aes brute force when part of data known [duplicate]

I have buffer of 16 bytes that encrypt with AES 128 cbc with IV =000000......(all IV is 0) I have the encrypted buffer, and I know 7 bytes from 16 bytes before the encryption , I dont know the key . ...
-1
votes
2answers
131 views

Can you encrypt a 256bit password with a 256bit key so that it cannot be bruteforced?

Lets say we have an arbitrary but dictionary attackable password that is less than 256bit. (Lets just say the password is '1234Password'). We encrypt this password with a securely random 256bit key ...
3
votes
1answer
266 views

AES-128 (CBC) brute force given 90+ rightmost bits of key, known IV and Ciphertext?

Given: Known ciphertext (in hex) (ciphertext is the exact length of the message (i.e. non-padded). It is known that the cipher was developed using CBC. There is one and only one ciphertext message ...
0
votes
0answers
322 views

Is reverse engineering SHA256-HMAC function possible? [duplicate]

Assume HMAC function is used to generate a 6-digt integers time-based onetime password. As follows: $$K_h =\operatorname{HMAC}(k,t) = H((k\oplus\text{opad})\mathbin\| H((k\oplus\text{ipad})\mathbin\|...
1
vote
0answers
92 views

Brute force against custom algorithm [closed]

In my free time, I write an algorithm for fun (and it may be the best hobby I had so far). Currently, the output this algorithm produces is indistinguishable. I ran multiple analysis process and asked ...
0
votes
1answer
301 views

Finding a secret key corresponding to a public key

As far as I know, a secret key corresponding to a given public key is not unique. So, for example, there are actually multiple secret keys that can produce the same digital signature under RSA ...
-3
votes
1answer
151 views

Time to guess a 100-bit key at one billion operations per second and one billion cores?

My math is as follows. If you can do one billion operations per second on a single core, and you have one billion cores available, that translates to $2^{60}$ operations per second, and $2^{100}$/$2^{...
0
votes
1answer
280 views

XTEA brute force 128 bits key, 64 rounds

Is my calculation correct that to bruteforce XTEA with 128 bit key: https://www.wolframalpha.com/input/?i=number+of+4-permutations+of+4,294,967,295+objects Would require that many permutations? Are ...
4
votes
2answers
3k views

Why do look up tables speed things up compared to brute force?

I'm currently reading up on lookup tables and efficiency. In my uni script it says the following: For Brute Force: Preparation time: $O(1)$ Disk space requirement: $O(1)$ Time required to crack the ...
1
vote
1answer
201 views

How to make my hash more robust to the brute force?

I'm using PBKDF2 SHA 256 with 100 000 iterations to generate a secret. I want to increase the cost of brute forcing the passphrase I use to generate the secret. I'm thinking of using scrypt after ...

1
2 3 4 5 6