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

learn more… | top users | synonyms

-4
votes
0answers
44 views

A way of bruteforcing a hash value without the use of file [closed]

An example is better than explanation. Let's say we have this md5 hash : 15e0adc0213e01ec44acee74ed4ece5b All I know is this hashing method is md5, the length of ...
4
votes
1answer
103 views

Understanding ransomware – What makes plain-text-attacks or brute-forcing so hard?

Say I have four files. Two are completely unencrypted, while the other two are the exact same files other than that they have been encrypted with (apparently) the same public key (via a ransomware ...
6
votes
2answers
111 views

Effect of $L_n[1/4,c]$ integer factorization on RSA-2048

Using the L-notation, integer factorization of an integer $n$ has the best known complexity of $L_n[1/3,c]$ using general number field sieve. Would discovery of an algorithm with complexity ...
3
votes
1answer
73 views

How secure is Shamir's Secret Sharing for password sharing when attacker has t-1 shares?

I am designing protocol to share a random generated n long password between k parties using Shamir's Secret Sharing. I know that share alone does not reveal much information about the original ...
3
votes
1answer
313 views

ECC keys vulnerable to brute force attack?

I have started learning about Elliptic curve cryptography. Since the key size required in ECC is relatively lesser than the key size in RSA to provide the same amount of strong encryptions, I wonder ...
4
votes
0answers
83 views

Brute force attack multiple stream cipher

Assume that a scheme used to secure a specific system $Π=(Gen,Enc,Dec)$ which is thought have indistinguishable multiple encryption in the presence of an eavesdropper. For any adversary $A$ that can ...
2
votes
1answer
78 views

Breaking a Modified Caesar Cipher

Does anyone know of an efficient way of breaking a modified Caesar cipher (where the key is a set of numbers (the amount of shift) that is repeated throughout the plaintext, e.g. {1,2,3,4,5}) via ...
0
votes
0answers
25 views

How do we measure number of possible encryptions in One Time Pad [duplicate]

trying to brute force a specific length of ciphered pad, how do we measure the total number of possible encryptions in One Time Pad
1
vote
1answer
86 views

Cracking simple RSA when just the ciphertext and one public key is known

Can someone explain to me (Or better yet, point me to a tool that does the brute forcing) how to crack a standard, simple RSA cipher (So don't bother with padding) if I know just one public key, the ...
6
votes
1answer
162 views

RSA reconstructing private key knowing MSBs

PREMISE: This question is purely theoretical because usually an attacker will not know private exponent d and can't compare it with obtained MSB bytes. Suppose an RSA 1024 bit signature. An attacker ...
0
votes
1answer
143 views

Calculating the average key search time of DES

I am trying to understand how to calculate the average key search time given a specific scenario: Suppose we have a program that uses standard DES with 56 key bits, and we can test 10^6 keys per ...
1
vote
1answer
75 views

How is RSA able to prevent brute forcing using the public key?

Bob calculates a private and public key. Bob sends his public key to John. Jeff is a third party unwanted member and manages to snatch the public key mid-transfer. John encrypts his message ...
0
votes
1answer
68 views

how to get the file used to brute force any encryption method [closed]

Bitlocker as example uses AES 128 Bit encryption as default - if it was brute forced how it can be done , I mean where's the file that will be brute forced to generate the password (If I'm right that ...
7
votes
2answers
120 views

Would it matter if my miner was hashing random vs incremental values?

I'm working on my miner for my "game" site that's basically a pre-image attack from a hash posted online. You submit a hash input, it's hashed, and your score is the hamming distance (the number of ...
2
votes
0answers
88 views

Is there a way to slow down collision attacks using iteration?

The simple way to iterate a hash function $H(H(m))$ only makes brute force preimage finding slower, but leaves collision attacks as fast since a collision in the inner hash function is a collision in ...
0
votes
1answer
192 views

How long does it take to brute force a Wordpress password?

I'm not a cryptograhpy expert, I am a web developer trying to determine the origin of a Wordpress blog hack, and how likely it is that it was brute forced. The administrator account username had been ...
2
votes
1answer
96 views

Memory hard password based key derivation functions?

How are memory hard functions designed for the purpose of password based key derivation? To protect against a brute force attack from a parallel machine. What design could work well with Skein? The ...
2
votes
1answer
65 views

Finding keys of modified DES encryption

This is a question I had in my exam today, and I'll be glad if someone can help me to find the answer. A student built an encryption algorithm (something between DES and 3DES), in which the ...
5
votes
2answers
503 views

SHA-256 exhaustive search

How do I calculate the number of computations needed to break SHA256 in case we are using it for safely storing passwords (together with a salt)? Are there any formulas that can be employed? For ...
0
votes
0answers
85 views

What is the danger if a non-prime is chosen for RSA? [duplicate]

I was reading this question about generating primes for RSA keys. The answers point out that most implementations of of the algorithm use probabilistic prime-ness checking algorithms. The answer by ...
4
votes
2answers
92 views

Brute-force attack given multiple hash prefixes

(Context: I'm auditing some code which I suspect to be insecure, but I'd like to be able to quantify this.) Suppose you have a 56-bit secret key ($secret), and ...
0
votes
2answers
82 views

Brute Force on Key

If you are brute forcing a key and trying trillions of combos, how will you know when you accidentally hit the right answer? Clearly you can't look at each decoded answer to see which "looks right".
0
votes
1answer
122 views

Has a collision ever been found for SHA-1/2/3 when truncated to 128 bits?

I'm aware that MD5 is broken, and collisions have been found for it. I'm interested in other hashes (SHA-1, SHA-2, SHA-3) when truncated to the same digest size, i.e. 128 bits. The time complexity of ...
3
votes
3answers
2k views

What is the difference between online and offline brute force attacks?

I read some papers saying a certain scheme is secure for offline brute force attacks, but vulnerable to online brute force attacks. I wonder the difference between the online and offline brute force ...
2
votes
2answers
274 views

Elliptic curve brute forcing

I have elliptic curve of equation $y^2 \equiv x^3 -x $. And the coordinate of points $Q$ and $P$. I want to solve $Q=[k]P$ (where $k$ is the unknown) by testing all possible $k$. Is this the right ...
2
votes
1answer
1k views

Practical brute-force attack on 128 bit encryption

In brute-force attack calculations cryptographers say we should assume an attacker will find the key after $2^{(n/2)}$ tries. If n=128, then n/2=64. We know that this is practical (A 64 bit key is ...
0
votes
0answers
51 views

Resynchronizing brute-force attack against stream ciphers

There is a stream cipher without any known cryptographic weaknesses. The attacker knows parts of the key so she can reduce the key-space to a size that can be practically brute-forced. However the ...
6
votes
1answer
274 views

what is the current actual budget - as of 2015 - needed to build a DES breaker machine?

EFF - Electronic Frontier Foundation - built a DES cracker for a budget of 250K$ in July 1998. I assume that as of 2015 - the cost of such a DES breaker would be less, are there any estimations about ...
0
votes
3answers
349 views

When is a cipher considered broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition? Is a cipher broken ...
1
vote
1answer
443 views

Why is AES unbreakable?

Why is it said that AES is unbreakable? Brute force attacks would take years to crack it, so is it possible to crack it if the computational speed of machines increase in the following decade?
0
votes
1answer
208 views

Java RSA Padding: no libraries used

I'm trying to implement RSA without using any java libraries using the algorithm from wikipedia HERE So, anyone can clearly see that it is a raw RSA, and can directly be attacked. The question is ...
0
votes
2answers
374 views

Practical Attack on RSA

Currently I am designing an RSA based application, and I am thinking of how long should the key be in order to be secure against attacks. I know that RSA 4096 bit key can be recovered using Sound ...
-4
votes
1answer
125 views

Unbreakable code and mathematical impossibility

Is an unbreakable code mathematically possible , considering a code with finite number of characters but has infinite combinations , using brute force is it not compulsory that the correct code be ...
-1
votes
4answers
548 views

Do Brute-Force Attacks and Cryptanalysis refute Kerckhoffs's principle? [closed]

According to Kerckhoffs's principle "A cryptosystem should be secure even if everything about the system, except the key, is public knowledge." Now I want to throw in a provoking formula of mine which ...
0
votes
0answers
44 views

DES key complementation property [duplicate]

It is known that DES has the key-complementation property. That is, given any key $k$ and any message $m\in\{0,1\}^{64}$ $$\operatorname{DES}_k(m)=\overline{\operatorname{DES}_\overline k(\overline ...
16
votes
4answers
1k views

How Brittle Are LCG-Cracking Techniques?

There are published techniques for cracking LCGs, but to my eye those techniques seem very brittle — very minor changes can add nonlinearity that renders techniques like the LLL algorithm unusable. ...
1
vote
1answer
614 views

BruteForcer XOR (bfxor.exe) to attack 64-bit keys and longer

First of all, this is not a beginner's question since I already know a good deal about encryption and brute-force attacks. This is also no question on how to code programs for brute-force attacks ...
1
vote
0answers
223 views

Brute Force AES Calculations

I have an encryption service in which the user decides the length and the type of key, so I would like to build a tool that educates the user on the brute force times for the key they created if using ...
2
votes
1answer
260 views

Small Encryption Exponent

I am trying to crack an unpadded RSA set up for a homework. I have public key (R,e) and encrypted message E. ...
0
votes
2answers
197 views

Does brute force attack use the program that created the ciphertext?

I've read several articles about brute force cryptanalytic attacks, but none explicitly say what algorithm is being run for each attempt, nor what criteria is used to declare an attempt a success or a ...
0
votes
2answers
115 views

Brute Force Attack Strategies

A Brute Force Attack obviously involves attempting to decrypt ciphertext (with the associated plaintext being known) using all possible encryption keys. Aside from attempting all possible ...
2
votes
1answer
407 views

AES-128 with weak key

Doing malware research (simple crypto locker) I found out that it uses AES-128 with weak key - every one of the sixteen bytes is represented by (a-z,A-Z,0-9). Thus simple brute-force attack should ...
2
votes
1answer
201 views

Hashing passwords

The common way to store passwords in web applications is this form: $$hash(password||salt)$$ Does it make sense to store them in the following form instead:? ...
3
votes
3answers
222 views

SRP-6 vulnerabilities when N is small

I'm one of the developers of an application which uses SRP-6 as the authentication mechanism. The authentication part of the code is very old and uses N with only 256 bits (all arithmetic is done in ...
1
vote
1answer
269 views

Importance of salt when deriving an encryption key

I'm very curious to know this and a bit confuses too: Suppose, I have two files encrypted using AES-128bit with keys PBKDF2-derived from the same password and the same salt. If an attacker does ...
2
votes
2answers
660 views

Can I crack an AES string if I have all these parameters?

This is for a challenge at followthewhiterabbit.trustpilot.com: Knowns: The algorithm is AES (Rijndael) Blocksize: 128 Keysize: 256 You only need to find the first 6 bytes of the ...
4
votes
1answer
109 views

Clarification of the terms “brute force” and “guess”

In the answer to the question “What exactly is a negligible (and non-negligible) function?” There is a part in the explanation that – as far as my knowledge goes – is conflicting: But instead of ...
3
votes
2answers
238 views

Using PBKDF2 twice with different argument order

I'm pretty sure this is a really bad approach (in theory), but one of my clients is doing this and I was wondering… How bad it is to perform pbkdf-2 in this way (with 2000 iterations)? ...
1
vote
1answer
174 views

Can 64-bit “PRINCEcore” practically be brute forced?

There is a cipher called PRINCE proposed in ASIACRYPT two years ago. See the paper: “PRINCE – A Low-latency Block Cipher for Pervasive Computing Applications” The cipher divides the 128-bit key into ...
2
votes
1answer
207 views

Is there a time-space tradeoff attack for breaking symmetrical cryptos?

Is there any known techniques for using time-space tradeoff for speeding up symmetrical crypto breaking? Kind of like rainbow tables speed up breaking hashes by using huge precomputed tables. Is ...