@jgraham
Obscurity is meant to be something just you know, or a specific recipient; cryptography is just one way to do it. But to very end, security is obscurity and the more obscurity you add to it the more security you get; may it be in method or final product.
You are engaging in "ignoratio elenchi".
Obscurity in the sense you're using it is simply something that a few people know. Here kokjo and myself are saying that what is being proposed only moderately increases the difficulty in finding the file with - no useful lower bound - by putting it in a location that is not expected. This is not even obscurity in your sense since the application itself has to know where the file is.
If the application does not know where the file is then you have to specify it each time (kokjo makes a good point about replacing the app but I'm assuming that we are trying to deal with a very narrow class of attacks).
However the facility for finding it exists in the OS (and in RAM but again that's another class of attack) and any user program has unrestricted access to this facility. Ergo this hurdle does not defeat a class of attacks and makes it marginally slower with no useful lower bound (I could scan your drive over the course of a day or two without putting very much load on your system).
Edit: Even if we go further and encrypt the file with a OTP that the user enters from memory (good luck!). I can still make short work of finding the file by search for files with some meta-characteristic. Like a small file with a write-lock.If you're a good cryptographer and can create your own algorithms you get twice of the protection: Your own algorithm nobody else's knows and the final product.
Cryptography is subtle. It is just as likely that your algorithm misses something because you have not shown it to nobody else. History is replete with people cracking algorithms which were not known. e.g. DVD's : 40 bit CSS had us ROTFL the day it was released.
Teams of people have poured over MD5, SHA1 and
we still are finding collisions and shortcuts. Please formally justify (using actually math) how the probability has a lower bound of absolutely no less than 2x of a key being found through an obscured algorithm than an unobscured one. Please show your work.
If you can't or don't want to create new algorithms you get standard protection: just the final product is protected, but the algorithm is widely known.
Which is done because we know the attack surface of these algorithms whereas your algorithm we do not.
If you are a lousy crypto and still go for it, you get half or less of protection; your easy to break/figure out algorithm and poorly encrypted data.
...and here it looks like you are begging the question.