Cryptography Lecture 24 Concrete parameters?
We have discussed two classes of cryptographic assumptions Factoringbased factoring RSA assumptions Dlog based dlog CDH and DDH assumptions In two classes of groups A ll these problems are believed to be hard ie to have no polynomialtime algorithms
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Cryptography Lecture 24 Concrete paramet..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.