Skip to main content
Information Security

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

16
  • 1
    He is asking how hard/possible is it to break the algorithm, given that there are infinite possibilities e.g. output = Gost*779317(Ecoh*441(Sha*33931(LOOP(274 times, Spectral*99228(Skein*991(Md5*77302(LOOP(931 times, Whirlpool*5503(Gost*7738(Sha*209(input))))))))))) etc. The attacker knows the input and the output, With that, can the attacker guess the algorithm? Commented May 14, 2014 at 7:04
  • 1
    @Pacerier if there are infinite possibilities, the probability of guessing it is approaching to 0 :-) Commented May 14, 2014 at 7:08
  • 1
    Zz, don't twist and avoid the question. The input is still x bits, the output is still y bits. He is asking can the attacker find a function F() such that he can invent his own inputs and outputs which match the supposedly secure algorithm. Basically, the question is asking Does doing those mixture of hash functions adds to security? Is it vulnerable (exists a short-cut such that the attacker can grab F() without having to brute force)? Commented May 14, 2014 at 7:12
  • 1
    It doesn't make sense because, as you explained, a simple lookup table will answer the literal question (if you take abstraction of the incorrect use of "brute forcing" anyway). Commented May 14, 2014 at 8:46
  • 1
    That is in the question: you have both the input and the output of the function. The question could be translated as "given two points on a plane, can you find a path between these two points". Of course, that question makes little sense so you have to extrapolate Commented May 14, 2014 at 9:51