A low-complexity LUT-based squaring algorithm

DOI10.1016/j.camwa.2008.11.018zbMath1186.94430OpenAlexW1967626797MaRDI QIDQ971658

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

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)

Related Items (1)

Efficient big integer multiplication and squaring algorithms for cryptographic applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoiding large squares in infinite binary words
• Fast modular multi-exponentiation using modified complex arithmetic
• An elliptic curve test for Mersenne primes
• New methods for approximating square roots
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• Optimal left-to-right binary signed-digit recoding
• Minimum weight modified signed-digit representations and fast exponentiation
• A Survey of Fast Exponentiation Methods
• More on squaring and multiplying large integers

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