A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli (Q1763231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli |
scientific article; zbMATH DE number 2136136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli |
scientific article; zbMATH DE number 2136136 |
Statements
A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli (English)
0 references
22 February 2005
0 references
Chinese remainder theorem
0 references
Generalized Chinese remainder theorem
0 references
Modular arithmetic
0 references
0.8071799874305725
0 references
0.7919312119483948
0 references
0.7788525819778442
0 references
0.7783855199813843
0 references
