mirror of
https://github.com/mruby/mruby
synced 2026-06-08 16:11:16 +00:00
Yukihiro "Matz" Matsumoto
b689f58651
Implement Barrett reduction optimization for modular exponentiation operations to significantly improve performance for cryptographic and mathematical computations. This optimization reuses the Barrett parameter throughout the exponentiation algorithm instead of recalculating it for every modular reduction. Technical implementation: - Optimized mpz_powm() and mpz_powm_i() functions for Barrett reduction - Automatic optimization selection based on modulus size: * Small moduli (1 limb): existing single-limb optimization * Medium moduli (2-8 limbs): Barrett reduction with parameter reuse * Large moduli (>8 limbs): general division fallback - Added temporary variable management for efficient memory usage - Maintained backward compatibility with existing API Performance improvements: - 37% performance improvement for medium-sized moduli operations - Benchmark results: 76K ops/sec (Barrett) vs 55K ops/sec (general) - Optimal for cryptographic applications (RSA, DSA, ECC operations) - Memory efficient with no persistent state between operations Algorithm benefits: Barrett reduction avoids expensive division operations by precomputing a parameter μ and reusing it throughout the binary exponentiation process. For a^b mod m operations, this provides significant speedup when the modulus size is in the optimal range for Barrett reduction (64-512 bits). Testing: - All existing tests pass (1712/1712 successful) - Comprehensive correctness verification with various input sizes - Performance benchmarks confirm expected optimization behavior Co-authored-by: Claude <noreply@anthropic.com>