Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

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
0 votes
1 answer
83 views

Dumb question about brute force attacks

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
193 views

Brute force against DES

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

In Bitcoin, given half the 52-character private key in WIF format, is it possible to reconstruct the whole private key?

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
92 views

Given and encrypted message, is it theoretically possible to decrypt a message without the key or guessing it? If so, what methods could be used?

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
0 votes
1 answer
54 views

Is it possible in LUKS1 to recreate a lost master key with the original password?

I accidentally overwrote a whole LUKS1 header without any backup. Since I still have the password with which the header was created - is there any way that this information helps me to reduce the ...
Philipp Murry's user avatar
6 votes
1 answer
303 views

NTRU Cryptosystem: Why "rotated" coefficients of key f work the same as f

In the NTRU cryptosystem, we can use a randomly generated polynomial f that is inversible under modulo p and q to encrypt and decrypt our plaintext. While studying this system, I attempted to ...
Ymi's user avatar
  • 175
0 votes
1 answer
105 views

Does higher key sizes correspond to a higher security parameter?

If a system provide n bits of security, it is known that the best possible attack against the system would be 2^n (security parameter). However, why are the key sizes of some cryptosystems much larger ...
rin ichinose's user avatar
0 votes
0 answers
23 views

Decrypting AES-128 with known regularly spaced single byte value [duplicate]

How would knowing a clear byte value of the decrypted data affect a brute force attack on an AES-128 encrypted message ? i.e. If I knew the 1st byte should decrypt to 0xff OR I knew that every 100 ...
D.Price's user avatar
4 votes
11 answers
9k views

For Symmetric Cryptography, why is it considered more important to safeguard a key than the function/algorithm for encrypting/decrypting a message?

As stated for the question above here's an analogy: You are a robber looking for a house to rob with two different scenarios that might occur. 1. You have a key that you know belongs to a house and ...
omar7439's user avatar
1 vote
2 answers
3k views

How weak is using AES with a 128 bit key but 64 bits of the secret key are public constants?

Respected community, I was wondering how weak would AES-128 be, if we provide only a 64 bit key with the other remaining 64 bits either zero bits or public constants, known to the attacker. Is it easy ...
Aravind A's user avatar
  • 1,030
0 votes
0 answers
43 views

On the exposition of SHA-1 attack (known_prefix + user_input + backend_secret)

In this question on sha1(known_prefix + user_input + backend_secret), an answer states that is realistically possible to find the first few bytes of ...
wjwrpoyob's user avatar
  • 101
3 votes
1 answer
337 views

Time Complexity of RSA Trial Division

I'm having trouble understanding how time complexity of trial division is exponential. If it takes $\sqrt n$ tries to factor $n$ in the worst case scenario then time complexity is $\mathcal{O}(\sqrt n)...
ikeachairs's user avatar
1 vote
2 answers
100 views

Can we find pairs $(c,m)$ with $f(c)=f(m)=true$ in $c = AES(m,K)$ with a fixed known Key $K$ significantly faster than brute force?

Different to the usual adversary use case we do not want to find the hidden key but instead pairs of $(m,c)$ which each fulfill a certain property $f(x)=true$ An example property could be e.g. 42 ...
J. Doe's user avatar
  • 453
1 vote
0 answers
62 views

Publishing a message with a computationally enforced delay [duplicate]

I'm looking for a way to publish a message, so that it will only be publicly known after some time (let's say a few minutes). Even I shouldn't have the power to prove what my message was, before this ...
Filip Sondej's user avatar
2 votes
1 answer
138 views

RC4 Klein (or other) attack susceptibility question

What issues do yall see with the following in terms of key recovery and related key attacks: RC4 used to "sign" a nonce: 3 byte nonce concatenated with 16 byte long term key > RC4 ...
HANGOBA's user avatar
  • 21
1 vote
1 answer
84 views

Identifying an encryption algorithm and/or writing an encryption function

I am currently trying to reverse engineer a piece of software that uses a seemingly-custom encryption algorithm. After disassembling the decryption part of the code, I've come up with the following ...
akasaka's user avatar
  • 131
1 vote
1 answer
171 views

Is considered safe saving encrypting files using asymmetric encryption algorithm inside public environments?

I know restricting access of a file, is a important measure of security. If we read the Payment Card Industry's Data Security Standard (aka PCI-DSS), we can see a requirement where control access must ...
Carl_Dude's user avatar
5 votes
1 answer
702 views

How can a preimage attack on SHA-256 always succeed within 2^256 evaluations when done though brute force?

I was reading the Wikipedia page for SHA-256 (SHA-2) and came across the following statement: For a hash function for which $L$ is the number of bits in the message digest, finding a message that ...
Darcy Sutton's user avatar
3 votes
0 answers
175 views

Is WPA2 collision-proof?

I was experimenting with hashcat and aircrack to test WiFi security. The WiFi AP is a WPA2 encrypted network. The tool I used to ...
Kristi's user avatar
  • 31
5 votes
4 answers
902 views

Does file size significantly affect brute-force time?

Suppose you have two files encrypted with AES-256. One of the two files is 5MB, the other one is over 1GB. Their passwords are reasonably strong: >12 characters, letters, numbers, upper and lower ...
Nicola's user avatar
  • 369
1 vote
0 answers
232 views

Determining the initial positions of Engima's rotors

We want to perform a known plaintext attack on the enigma M3, the goal is to reach the initial settings of the 3 rotors. I tried to bruteforce those values since I know the plaintext, ciphertext, ...
Khalil's user avatar
  • 11
2 votes
1 answer
142 views

Clarification on expected number of plaintext, ciphertext pairs needed to identify AES keys

I'm aware of the many questions on this topic, but I'm still not sure what went wrong with my reasoning here below. I'm assuming use of AES with key size $2^{256}$ and messages of size $2^{128}$, ...
Anon's user avatar
  • 403
1 vote
1 answer
258 views

Is it possible to bruteforce a 200 bit hash generated with PBKDF2, in which the first 160 bit are known?

As some password manager, such as KeyPassXC allows a user to create a master password using a HMAC response from a YubiKey concatenated with a password entered by user, I was wondering something. ...
romes's user avatar
  • 11
4 votes
1 answer
574 views

Understanding the small cofactor attack with Elliptic Curves of non-prime order

I came across 2 older answers (2 different but similar questions on the small cofactor attack) which cover this attack. https://crypto.stackexchange.com/a/12614/3941 Here the attacker replaces the $...
user93353's user avatar
  • 2,235
0 votes
1 answer
95 views

Equivalance of encryption and decryption in DES under bruteforce

I am studying the vulnerability of DES algorithm. Let there be a DES system with 5 keys, 56bits each. Encryption works as follows: (It's in this order on purpose) $C=DEC_{k1}(ENC_{k2}(ENC_{k3}(DEC_{k4}...
nimrod891's user avatar
3 votes
1 answer
162 views

Quantifying the success probability of brute force attack against (search) LPN

I've been trying to learn about attacks on LPN ($n$-bit secret, noise rate $\eta$), and have found several allusions to a brute force algorithm that runs in time exponential in $n$ and requires a ...
Gordon's user avatar
  • 45
1 vote
1 answer
307 views

Does RIPEMD-320 provides the same level of security as RIPEMD-160?

This article from Wikipedia claims that "256- and 320-bit versions of RIPEMD provide the same level of security as RIPEMD-128 and RIPEMD-160, respectively". Is that true or false ? And why ?
oqdn's user avatar
  • 57
0 votes
0 answers
90 views

Enumerating values from a linear congruential generator java Random()

During my research on a java application, I discovered that the nextInt(64) function of the java.Random() class is used to ...
Sergey Unk's user avatar
1 vote
1 answer
662 views

Are brute-force attacks made more difficult by removing the LUKS header?

If the LUKS header is removed from the LUKS partition, will this make the brute-force attack much more difficult? Can software tell which type of partition is it?
kytebucks000's user avatar
0 votes
1 answer
956 views

64 bit key size Diffie Hellman

I am building a cryptographic El Gamal implementation on the Cardano Blockchain for a poker game. Each hand the players generate a DH 64 bit keys and shuffle the cards together via homomorphic ...
Fermat's user avatar
  • 101
0 votes
1 answer
267 views

Using MS Azure to crack password

I heard there is a possibility to perform a brute force attack of an password, I know there is an option to use graphic cards on AWS, but is there a solution for Azure too? Which costs would it take ...
koko9l's user avatar
  • 1
0 votes
1 answer
200 views

Protection (nonce addition?) against key discovery in AES 256

I've got a situation where I need to send message ciphered with AES-256. However the content, and therefore length, of the message may be intercepted before (don't ask;)) and the question I was asked ...
Pączek w maśle's user avatar
0 votes
0 answers
68 views

How could I find the correct key pair given the plaintext and ciphertext

If I have a known plaintext and ciphertext pairs and 2 unknown keys of length 24 bits. (Assume encryption method is unknown) ...
Volapiik Vyrient's user avatar
2 votes
1 answer
829 views

Is it possible to brute-force the nonce used in ECDSA?

It is a well-known fact that knowing the nonce used in signing the ECDSA signature allows the private key to be computed easily from that signature. If I understand it correctly, this nonce is a ...
Mr. Engineer's user avatar
1 vote
1 answer
265 views

Is there a benefit to "double encryption" when it comes to attacks analyzing attempted decryption results?

This is a beginner's question related to general security, but it fits cryptography exchange because it's more specific to the action of cryptographic attacks and how they work. Assume the following ...
RobbB's user avatar
  • 189
1 vote
1 answer
66 views

Statistical Cryptanalysis. Would one "reverse" weak key schedule algorithms or peel off each one of internal rounds?

The context is iterated ciphers. Regarding Differential and Linear Cryptanalysis, the methods seem to make a cryptanalyst able to do an educated guess on a partial subkey (e.g. bits from the last ...
Alessio Proietti's user avatar
3 votes
2 answers
859 views

How secure is it to share "Passwords" using Shamir Secret Sharing given a way to verify if password is correct?

Lets say you have a order $n$ finite field which you are using to create $k$ shares for a password using Shamir Secret Sharing. Assume that the attacker gets $k-1$ shares. Is it possible that the ...
Makky 56's user avatar
0 votes
0 answers
44 views

Algorithms for reducing the scope of a brute force attack on a cryptosystem? [duplicate]

I understand that during a brute force attack on a cryptosystem, an attacker is left with many, many, junk files, some which are partially readable (depending on the crypto algorithm used), and 1 ...
Kevin DeCara's user avatar
1 vote
0 answers
516 views

Cracking secret key, n, and m by hand with the Diffie-Hellman key exchange brute force

Problem: You see Michael and Nikita agree on a secret key using the Diffie-Hellman key exchange. Michael and Nikita choose $p = 97$ and $g = 5$. Nikita chooses a random number n and tells Michael that ...
BoostMatch's user avatar
1 vote
1 answer
431 views

What are those RSA Challenges, DES Challenges and RSA Factoring Challenges

Can someone explain the differences between the DES challenge, the RSA challenges, and the RSA factoring challenge? What were the aims? I think the factoring challenge was to encourage research, the ...
george s's user avatar
0 votes
2 answers
1k views

Is it possible to get the SHA256 hash collision with partial known data

I have a text sentence that consists of 448 digits [0-9] [a-f] (in HEX format). This text sentence is partially cut off, but I know the middle, and the beginning ...
Dew Debra's user avatar
1 vote
1 answer
383 views

To what degree does a high PKBDF-HMAC-SHA1 iteration count compensate for a weak passphrase entropy?

Lost a LUKS-encrypted laptop at the end of 2019 and now trying to figure out the odds of a very sophisticated attacker being able to break in. The LUKS container was created mid-2017 with LUKS1 ...
Peter_Python's user avatar
3 votes
2 answers
282 views

Don't human generated passwords used with key derivation functions reduce the security of symmetric encryption?

The key size for AES is chosen as 256 because that's considered the minimum keysize which can protect against a brute force attack - i.e. $2^{256}$ tries. However, in practice, for a lot of ...
user93353's user avatar
  • 2,235
1 vote
1 answer
495 views

Does keeping the IV secret in OFB mode makes brute-force more complex?

If we keep the IV secret, does that increase the complexity of finding the correct key? My first thought is that it increases complexity, but in real world, I can see that IV's aren't kept secret. We ...
Abra Cadabra's user avatar
1 vote
0 answers
53 views

Matching accounts across multiple data leaks via their hashed passwords

I've heard about several instances where OSINT researchers were able to match user accounts from multiple data leaks purely based on their hashed passwords, assuming accounts had the same password on ...
nisc's user avatar
  • 111
6 votes
1 answer
173 views

Difficulty of computing RSA keypair with given bits preset

Given a 2048-bit RSA public key physically burned into hardware, is it feasible to find a keypair where the public key could be "overlaid"? To detail, each bit in the hardware key is write-...
PixelPower's user avatar
2 votes
2 answers
1k views

Time Complexity of Exhaustive Search Algorithm

I have the sets $S_1=\{2,10,20,6\}$ and $S_2=\{25,26,20\}$ and I want to find which numbers sum to make 32. This is very easy by inspection; 6 and 26. It seems similar to the Knapsack problem, but I ...
MeBadMaths's user avatar
0 votes
0 answers
184 views

Proof of theoritical security of Shamir's secret sharing

community ! I'm looking for the proof of theoritical security of Shamir's secret sharing. I found some articles saying that it's assimilable to the halting problem, which implies that there is no ...
hambam's user avatar
  • 21
1 vote
1 answer
308 views

Time complexity of a brute force attack on Shamir's Secret Sharing SSS

I have searched everywhere in academic papers about time complexity of a brute force attack on a Shamir's Secret Sharing key. I'm confused between if it is $O(p^k)$ or $O(p)$, such that $p$ is the ...
hambam's user avatar
  • 21
1 vote
0 answers
132 views

How to calculate how long it will take to break deliberately weakened AES encryption?

for a project I'm looking to make as an art project a series of encrypted "time capsules" that have deliberately weak encryption, enough that it isn't feasible to crack them now, but could ...
Jayden Milne's user avatar

1
2 3 4 5
7