Method for validating an exponentiation result with the Chinese remainder theorem forms extra modules with two primary numbers for calculating extra values to work out a modular exponentiation to match the product of the values.

摘要

First (p) and second (q) primary numbers as modules are used to calculate first (sp) and second (sq) extra values, which join by using a Garner joining algorithm in order to get a result for an exponentiation calculation. After joining the values, the result of the exponentiation calculation is checked by means of a test algorithm that differs from the joining algorithm but delivers a pre-defined result if the joining function has been run correctly. An independent claim is also included for a device for validating an exponentiation result with the Chinese remainder theorem.