ABSTRACT
We have seen in the previous chapter, that efficient designs of cryptographic algorithms require proper understanding of underlying finite field primitives. Like the AES, most ciphers are developed using complex mathematical operations, relying largely on finite fields. The Elliptic Curve Cryptosystems are the current generation choice for public key ciphers. As discussed in Chapter 2, they also rely heaviliy on finite fields. These are somewhat more complex, as they operate on larger bit sizes as the primitives required in AES. Further, unlike AES, the bit-sizes of these designs vary, and thus have to be scalable.
