Table 1 Comparison of parameters and the times of final subtraction (\(s = \frac{n}{2}\)).
From: Optimized quantum folding Barrett reduction for quantum modular multipliers
Algorithm | Precomputed parameters \(\{size\}\) | The times of final subtraction |
|---|---|---|
General Barrett Reduction | \(\mu = \left\lfloor \frac{2^{2n}}{N} \right\rfloor \{2s+1\}\) | 2 |
Folding Barrett Reduction | \(N' = 2^{3s} \mod N \{2s\}\) | 3 |
\(\mu = \left\lfloor \frac{2^{3s}}{N} \right\rfloor \{s+1\}\) | ||
Optimized Folding Barrett Reduction | \(N' = 2^{3s} \mod N \{2s\}\) | 1 |
\(\mu = \left\lfloor \frac{2^{3s+3}}{N} \right\rfloor \{s+4\}\) |
