The hardest part of the section was the explanation of the El Gamal digital signature algorithm for elliptic curve cryptosystems.
It's interesting how much simpler certain cryptographic algorithms can be when they are implemented using elliptic curves. This is because the operations that are analogous to modular multiplication and modular exponentiation on elliptic curves are much easier to perform, but are just as strong cryptographically as systems implemented using large prime numbers. It's interesting to see alternate ways of implementing familiar cryptosystems.
No comments:
Post a Comment