Low complexity montgomery multiplication architecture for elliptic curve cryptography over GF(p:::m:::)

Somsubhra Talapatra, Hafizur Rahaman. Low complexity montgomery multiplication architecture for elliptic curve cryptography over GF(p:::m:::). In 18th IEEE/IFIP VLSI-SoC 2010, IEEE/IFIP WG 10.5 International Conference on Very Large Scale Integration of System-on-Chip, Madrid, Spain, 27-29 September 2010. pages 219-224, IEEE, 2010. [doi]

Abstract

Abstract is missing.