I am reading the documentation for Kentico where it describes using hashes to validate query strings
EX:http://localhost/KenticoCMS8/cms/getfile/2d003444-9a27-43c9-be97-4f5832474015/Partners_logos_silver.aspx?latestfordocid=75&hash=eee41e027bd45142fd1f44d173d61950f34d6e98f4e35018fda70542322adc77&chset=013bca78-6bf2-42ac-8959-b8bbbeb0a8e8
Documentation https://docs.kentico.com/display/K8/Query+string+hashing
I am making an assumption: On it's own hashing a query string and including it as part of the string is not useful. Anyone who knows the algorithm (published int he help doc)could simply generate the hash from his new malicious query-string, and include it as part of the request.
The added protection that Kentico uses is a static salt that is included when hashing the query-string. This should make generating your own hash not as simple.
My question is how difficult would it be to solve this salt? An attacker could easily generate many different query strings They would know the input, the output, and the algorithm. Could they simply figure out the salt?
And if they know the salt, can they then without any difficulty generate their own query-strings?