Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability