Linear systolic multiplier/squarer for fast exponentiation

DOI10.1016/S0020-0190(00)00131-9zbMATH Open1339.68012MaRDI QIDQ294863FDOQ294863

Authors Keon-Jik Lee, Kee-Young Yoo

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019000001319?np=y

zbMATH Keywords

cryptographypublic key cryptosystemcommon-multiplicand multiplicationfast exponentiationMontgomery algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

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)

• A class of systolic multiplier units for VLSI technology
• A low-complexity LUT-based squaring algorithm
• Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
• Square always exponentiation
• scientific article; zbMATH DE number 1796971 (Why is no real title available?)

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)