Linear systolic multiplier/squarer for fast exponentiation
From MaRDI portal
Publication:294863
Recommendations
- A systolic, linear-array multiplier for a class of right-shift algorithms
- scientific article; zbMATH DE number 1796971
- Design of a linear systolic array for computing modular multiplication and squaring in \(\text{GF}(2^m)\)
- scientific article; zbMATH DE number 2089179
- scientific article; zbMATH DE number 1024035
Cites work
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1024055 (Why is no real title available?)
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- A method for obtaining digital signatures and public-key cryptosystems
- Modular Multiplication Without Trial Division
Cited in
(5)
This page was built for publication: Linear systolic multiplier/squarer for fast exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294863)