Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC

DOI10.1109/TCSI.2018.2791285MaRDI QIDQ4956691zbMATH OpenOpenAlexFDO

Authors Shoukat Ali, Murat Cenk

Publication date 2 September 2021

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL http://etd.lib.metu.edu.tr/upload/12621480/index.pdf

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(1)

• A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli

This page was built for publication: Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956691)