A high performance ROM-based structure for modular exponentiation

DOI10.1016/J.COMPELECENG.2011.01.002zbMATH Open1221.68296OpenAlexW2060992980MaRDI QIDQ553840FDOQ553840

Authors: Giuseppe Alia, Enrico Martinelli 

Publication date: 28 July 2011

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compeleceng.2011.01.002

Recommendations

• Compact modular exponentiation accelerator for modern FPGA devices
• scientific article; zbMATH DE number 1024035
• scientific article; zbMATH DE number 1617929
• Hardware Complexity of Modular Multiplication and Exponentiation
• scientific article; zbMATH DE number 1953319
• Three hardware architectures for the binary modular exponentiation: sequential, parallel, and systolic

zbMATH Keywords

modular exponentiation devicesperformance enhancementprocessing with large numbers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited In (4)

• Title not available (Why is that?)
• A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• An algorithm for modular exponentiation.

This page was built for publication: A high performance ROM-based structure for modular exponentiation

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