Some suggestions and theories

[Mauro]

 While it may look impossible with the current technology (for a set with 30 [and since the manuscipt doesn't contain punctuation and numerical symbols the actual number is going to be bigger] symbols checking all 30! bijective functions would take 100s of years on a PC capable of doing 10^9 ops/sec)

I think you're underestimating the sheer magnitude of 30!. It's ~2.65 *10^32. A computer able to check 10^9 bijective functions/sec (which is a lot faster than doing 10^9 ops/sec) will take 2.65 * 10^23 seconds to check them all, that is to say ~5 * 10^16 years, or 5 * 10^14 100s of years. About 3.8 million times the current age of the universe.