The cache is not at the posted coordinates. There are 2 parts to this cache. First, you decrypt a message that will be needed in part 2. Part 2 is a wherigo that will use the result from part 1 and allow you to work your way to the final.
Part I
For part 2, you will need three 6 digit numbers. The information is encrypted and your job is to decrypt it. Unlike all the other encryption puzzle caches out there, I will tell you exactly how to decrypt the message!
The message below is encrypted using RSA. This is the same algorithm used by banks to transfer money. The main difference between what banks use and what you see below is that I am using (relatively) small numbers. If a bank did the encryption using such simple keys, crooks could trivially decode messages. Instead of the small numbers used below, banks commonly use 2048 bit long numbers (over 600 digits in base 10).
Historically, most encryption used symmetric cryptography: you had a password that was used to encrypt and decrypt a message. If someone stole the password, then all your messages could be read. RSA is asymmetric: there is a public and a private key. You can encrypt with either key but the other key must be used to decrypt the message. The amazing part is that you never give out the private key so there is less danger of it being stolen. Asymmetric cryptography is extremely powerful and you can read the wikipedia page for more information.
Since it would take quite a bit of explaining why the math below works, and since the wikipedia page on RSA already has a good article on the subject, this cache will focus on the actual encryption and decryption process.
m = original message, which you need to discover
private key = (n, d) = (98069009, 265) which is normally kept, um, private
public key = (n, e) = (98069009, 369997) which anyone can see without any loss of security
encrypted message = c = m^d mod n = m^265 mod 98069009 (I already did this part)
Note: ^ is exponentiation and mod is modular arithmetic. A convenient site to do the math can be found HERE. Please use that site as every other online site I tried fails with such large numbers.
Decryption is very similar: m = c^e mod n = c^369997 mod 98069009
As you can imagine, the numbers get big fast. If the original message was done in one shot the numbers would have been much larger so it was decided to split it into 3 parts. Here are the 3 messages you need to decipher:
c1 = 19268481
c2 = 60573601
c3 = 65605133
Note: if the 3 messages are decrypted correctly, the digits should add up to 65.
Part II
Armed with the 3 messages from Part I, you can use them to run a wherigo published by -Waldmeister-. This wherigo works differently than most as instead of being given zones to visit, you query the cartridge for the distance to the cache. By careful triangulation you should be able to eventually get to the actual cache.
Download the wherigo cartridge from HERE.
Start the cartridge and follow the instructions. There is no point in running the cartridge before doing the math in the first section of the cache page.
After finding the cache
If you would like to place your own reverse wherigo, note the password that is added to your inventory after successfully finding this cache.