A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli

DOI10.1016/J.AMC.2003.12.018zbMath1102.11314OpenAlexW1983195439MaRDI QIDQ1763231

Chin-Chen Chang, Yeu-Pong Lai

Publication date: 22 February 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.018

zbMATH Keywords

Chinese remainder theoremModular arithmeticGeneralized Chinese remainder theorem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Related Items (2)

A note on Chang-Lai's modular square algorithm based on the generalized Chinese remainder theorem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Optimal left-to-right binary signed-digit recoding
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Root sets of polynomials modulo prime powers

This page was built for publication: A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli