A low-complexity LUT-based squaring algorithm

DOI10.1016/J.CAMWA.2008.11.018MaRDI QIDQ971658zbMATH OpenOpenAlexFDO

Authors Te-Jen Chang, Chia-Long Wu, Der-Chyuan Lou, Ching-Yin Chen

Publication date 16 May 2010

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2008.11.018

zbMATH Keywords

information securitypublic-key cryptosystemmodular multiplicationfast algorithm designsquaring

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• Square always exponentiation
• Multi-precision squaring for public-key cryptography on embedded microprocessors
• New modular multiplication algorithms for fast modular exponentiation
• Linear systolic multiplier/squarer for fast exponentiation
• Parallel modular multiplication with table look-up

Cites work

• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 3322464 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• An elliptic curve test for Mersenne primes
• Avoiding large squares in infinite binary words
• Fast modular multi-exponentiation using modified complex arithmetic
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• Minimum weight modified signed-digit representations and fast exponentiation
• More on squaring and multiplying large integers
• New methods for approximating square roots
• Optimal left-to-right binary signed-digit recoding

Cited in

(3)

• Multi-precision squaring for public-key cryptography on embedded microprocessors
• Square always exponentiation
• Efficient big integer multiplication and squaring algorithms for cryptographic applications

This page was built for publication: A low-complexity LUT-based squaring algorithm

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