Pages that link to "Item:Q1763231"
From MaRDI portal
The following pages link to A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli (Q1763231):
Displaying 4 items.
- A note on Chang-Lai's modular square algorithm based on the generalized Chinese remainder theorem (Q2371449) (← links)
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (Q3806810) (← links)
- (Q3974946) (← links)
- Simplification on dynamic range of a generalized Chinese remainder theorem for multiple integers (Q5384162) (← links)