The most difficult part of this reading assignment was the section about security of ElGamal ciphertexts. Mainly I just had difficulty understand the proposition given in section 7.5.1.
I enjoyed reading about other ways in which the principles of public key cryptography can be implemented; specifically through Diffie-Hellman and ElGamal. The security of these systems, as in the case of RSA, is built upon mathematical operations which are computationally infeasible. This has made me wonder about other mathematical operations which are computationally infeasible, and thus could somehow serve as the basis of a public key cryptography algorithm.
No comments:
Post a Comment