Cryptography, Volume 7, Issue 4
2023 December - 19 articles
Cover Story: Elliptic curve cryptography (ECC) over prime fields relies on scalar point multiplication realized by point addition and point doubling. Point addition and doubling operations consist of many modular multiplications of large operands. Accelerating modular multiplication is therefore important for high-performance ECC. This paper presents the hardware implementations of modular multiplication algorithms, including interleaved modular multiplication, Montgomery modular multiplication, shift-sub modular multiplication (SSMM), SSMM with advance preparation, and SSMM with CSAs and sign detection algorithms. We also present the ECC hardware implementations based on the Secp256k1 protocol in affine, projective, and Jacobian coordinates, and evaluate their cost and performance. View this paper - Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
- You may sign up for email alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.