A New Algorithm for Residue Multiplication Modulo $$2^{521}-1$$

DOI10.1007/978-3-319-53177-9_9zbMath1381.94060OpenAlexW2594261824MaRDI QIDQ2988345

Murat Cenk, Shoukat Ali

Publication date: 19 May 2017

Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_9

zbMATH Keywords

Mersenne primeelliptic curve cryptographyToeplitz matrix-vector productresidue multiplication

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Faster ECC over $$\mathbb {F}_{2^{521}-1}$$
• Curve41417: Karatsuba Revisited
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0

This page was built for publication: A New Algorithm for Residue Multiplication Modulo $$2^{521}-1$$