An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
From MaRDI portal
Recommendations
- Montgomery in practice: How to do it more efficiently in hardware
- Montgomery's multiplication technique: How to make it smaller and faster
- A scalable architecture for Montgomery multiplication
- Applied Cryptography and Network Security
- A scalable and systolic architectures of Montgomery modular multiplication for public key cryptosystems based on DSPS
Cites work
Cited in
(16)- A versatile Montgomery multiplier architecture with characteristic three support
- Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
- Scalable algorithm for Montgomery multiplication and its implementation on the coarse-grain reconfigurable chip
- Montgomery and RNS for RSA hardware implementation
- Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
- Cox-Rower architecture for fast parallel Montgomery multiplication
- Achieving NTRU with montgomery multiplication
- Montgomery in practice: How to do it more efficiently in hardware
- Montgomery's multiplication technique: How to make it smaller and faster
- A scalable architecture for Montgomery multiplication
- Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
- An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
- Applied Cryptography and Network Security
- scientific article; zbMATH DE number 5041007 (Why is no real title available?)
- scientific article; zbMATH DE number 2230910 (Why is no real title available?)
- Programmable cellular automata based Montgomery hardware architecture
This page was built for publication: An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445455)