Skip to main content

Questions tagged [md5]

MD5 is a hash function that is no longer considered secure from a cryptographic point of view. Therefore, it should only be used for backward compatibility.

1 vote
1 answer
144 views

If MD5 is used as the hash function for signature generation, then is SPHINCS+ still secure given that it is based on preimage resistance?
Melab's user avatar
  • 4,328
0 votes
1 answer
56 views

Since all hashing functions have a finite (but quite large) number of hashes. So let's say a hashing function can produce total X hashes. Now I sent it 10X inputs (I know there are computational ...
Amit's user avatar
  • 3
5 votes
2 answers
196 views

I've recently discovered a potential vulnerability in the type system of Haskell, a functional programming language in use in critical applications at Facebook, Standard Chartered, Input Output et ...
Curious Programmer's user avatar
0 votes
1 answer
170 views

My intuition is that this is probably fairly unfeasible, but I'd like to ask anyway to see if I'm missing anything. I have a list of 8-byte input (e.g. in hexadecimals: ...
nayfaan's user avatar
  • 101
2 votes
0 answers
72 views

I'm failing to understand how length recovery attack works in EAP-MD5 described in this paper on page 6: https://inria.hal.science/hal-01534313/document I setup ...
julumme's user avatar
  • 71
0 votes
2 answers
1k views

I have an MD5 hash and need to generate a file that matches it. There are absolutely no constrains on the contents of said file, it can be binary gibberish. The only important thing is that it matches ...
Werdck's user avatar
  • 11
0 votes
1 answer
220 views

I'm taking 2 medium-length strings (50-70 chars) and hash them using md5 to get results like d2ae4f4919a10958e2c603782f0ec1cc, then recording the first 5 symbols of ...
ADC's user avatar
  • 3
0 votes
1 answer
113 views

I want to generate some tokens for client as http cookie can I md5 them with salt and then use "<random token>"+"<md5>" as the token ...
xingxing hao's user avatar
0 votes
1 answer
249 views

In this image, It describes the basic idea of an iterative hash function. I am confused as to why the i value is set to be m+t+1 ...
Simon Balfe's user avatar
3 votes
1 answer
286 views

I wanna do an experiment. I wanna see if it's possible to sign in to an outdated website that still uses MD5 to store passwords (there are surprisingly still a lot) with two different passwords. For ...
Domino's user avatar
  • 31
3 votes
1 answer
2k views

I'm trying to find a MD5 hash collision between 2 numbers such that one is prime and the other is composite (at most 1024-bit). I'm using fastcoll with random prefixes for each iteration. For this I ...
infinite-blank-'s user avatar
3 votes
2 answers
743 views

I am working on a project for my maths assessment where I research the effect of complexity and length on a given password. Currently, I am working on calculating the probability of guessing a ...
user avatar
4 votes
0 answers
121 views

I wonder if there is any practical attack on MD5(key || fixed-length-message).
edo1's user avatar
  • 163
1 vote
1 answer
377 views

The original description of the MD5 algorithm initializes the values of A, B, C, and D to the following: ...
jaip's user avatar
  • 11
0 votes
0 answers
260 views

So I get how it works for inputs shorter than $512$, but as for larger inputs "In the case where the remaining input data is exactly $448$ bits long, an entire extra block would need to be added ...
tiredpotato's user avatar

15 30 50 per page
1
2 3 4 5
18