A low-complexity LUT-based squaring algorithm

DOI10.1016/J.CAMWA.2008.11.018zbMATH Open1186.94430OpenAlexW1967626797MaRDI QIDQ971658FDOQ971658

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

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

zbMATH Keywords

information securitypublic-key cryptosystemmodular multiplicationfast algorithm designsquaring

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)