Computer Science – Cryptography and Security
Scientific paper
2009-08-04
Computer Science
Cryptography and Security
4 pages
Scientific paper
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 complement to but not a replacement of exact security analysis, and should not tempt cryptology, a type of bit magic, to deviate the technological track. Also think that it is possible in terms of the two incompleteness theorems of Kurt G\"odel 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.
Lu Shuwang
Su Shenghui
No associations
LandOfFree
REESSE1+ . Reward . Proof by Experiment on 80-bit Moduli does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with REESSE1+ . Reward . Proof by Experiment on 80-bit Moduli, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and REESSE1+ . Reward . Proof by Experiment on 80-bit Moduli will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-557369