Question

if DLP is hard then argue that schnorr identification scheme is secure

if DLP is hard then argue that schnorr identification scheme is secure

0 0
Add a comment Improve this question Transcribed image text
Answer #1

If DLP is hard then knowledge of discrete log can be proved without revealing any information about discrete log.
Hard DLP secure the random model of Oracle for an ideal hash (2k-bit hash which is truncated to k-bit). It also secures the RSPP and RPP hash with 4t-bit signature or 3t-bit signature. Thus overall the schnorr identification scheme is secure for random oracle model and overall they has no drewback.

Add a comment
Know the answer?
Add Answer to:
if DLP is hard then argue that schnorr identification scheme is secure
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT