High performance elliptic curve GF(2/sup k/) cryptoprocessor architecture for multimedia

Abstract

A high performance GF(2/sup k/) elliptic curve crypto processor architecture suitable for multimedia security is proposed. To meet the high data rates of multimedia, the new architecture exploits parallelism within elliptic curve point operations after using projective coordinates. In this paper, the decision on which projective coordinate to use is based on its efficiency with regard to its parallel implementation. Two different projective coordinates are compared here. This parallelism is exploited in the new architecture by using three separate bit-level pipelined digit serial-parallel multipliers that can operate in parallel. It is worth pointing that such multipliers are ideally suited for the repetitive multiplications inherent in elliptic curve cryptography. it is believed that such high performance architectures are needed for high end servers that need to support the security of many multimedia streams at the same time.