Hardware Complexity of Modular Multiplication and Exponentiation

DOI10.1109/TC.2007.1084MaRDI QIDQ4564213zbMATH OpenOpenAlexFDO

Authors Jean-Pierre David, Kassem Kalach, Nicolas Tittley

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2007.1084

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Cited in

(5)

• Operand Folding Hardware Multipliers
• scientific article; zbMATH DE number 5017575 (Why is no real title available?)
• scientific article; zbMATH DE number 4057005 (Why is no real title available?)
• scientific article; zbMATH DE number 1341879 (Why is no real title available?)
• A high performance ROM-based structure for modular exponentiation

This page was built for publication: Hardware Complexity of Modular Multiplication and Exponentiation

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