A low-complexity LUT-based squaring algorithm
type: Item
instance of: scholarly article
title: A low-complexity LUT-based squaring algorithm
zbMATH Open document ID: 1186.94430
author: Te-Jen Chang
author: Chia-Long Wu
author: Der-Chyuan Lou
author: Ching-Yin Chen
publication date: 2010-05-16T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5708472
zbMATH Keywords: information security
zbMATH Keywords: squaring
zbMATH Keywords: fast algorithm design
zbMATH Keywords: modular multiplication
zbMATH Keywords: public-key cryptosystem
MaRDI profile type: Publication
full work available at URL: j.camwa.2008.11.018
OpenAlex ID: W1967626797
cites work: Q4344097
cites work: Q4718481
cites work: More on squaring and multiplying large integers
cites work: Q5601777
cites work: Minimum weight modified signed-digit representations and fast exponentiation
cites work: A Survey of Fast Exponentiation Methods
cites work: Optimal left-to-right binary signed-digit recoding
cites work: Avoiding large squares in infinite binary words
cites work: New methods for approximating square roots
cites work: An elliptic curve test for Mersenne primes
cites work: Fast modular multi-exponentiation using modified complex arithmetic
cites work: How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
DOI: 10.1016/J.CAMWA.2008.11.018
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5708472