REESSE1+ . Reward . Proof by Experiment on 80-bit Moduli

The authors discuss what is a proof, what is provable security, and what are approaches to provable security. Think that provable security is asymptotic, relative, and dynamic, is only a supplement to but not a replacement of exact security analysis, and should not tempt cryptology, a type of bit magic, to deviate from the technological criterion. Also think that it is possible in terms of the two incompleteness theorems of Kurt Godel that there are some cryptosystems of which the security cannot be proven in the random oracle model, and any academic conclusion should be checked and verified with practices or experiments as much as possible. Lastly, a reward is offered for the subexponential time solution of the three REESSE1+ one-way problems: MPP, ASPP, and TLP with n >= 80 and lgM >= 80, which may be regarded as a type of security proof by experiment.