A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
type: Item
instance of: scholarly article
title: A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
zbMATH Open document ID: 1102.11314
author: Chin-Chen Chang
author: Yeu-Pong Lai
published in: Applied Mathematics and Computation
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 2136136
zbMATH Keywords: Chinese remainder theorem
zbMATH Keywords: Generalized Chinese remainder theorem
zbMATH Keywords: Modular arithmetic
MaRDI profile type: Publication
full work available at URL: j.amc.2003.12.018
OpenAlex ID: W1983195439
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Optimal left-to-right binary signed-digit recoding
cites work: Q3792737
cites work: Root sets of polynomials modulo prime powers
cites work: A method for obtaining digital signatures and public-key cryptosystems
DOI: 10.1016/J.AMC.2003.12.018
description: scientific article; zbMATH DE number 2136136