We are in SystemC

binding:

Encode or cipher the message in msg using the RSA public key P=( e, n ).

------------------------------------------------------------------------------ "sc_method_process::clear_trigger" This method clears any pending trig

compare test output with golden reference

Dencode or decipher the message in msg using the RSA secret key S=( d, n ).

non-virtual deep-copying of the object

------------------------------------------------------------------------------ "sc_thread_process::disable_process" This virtual method suspends this

------------------------------------------------------------------------------ "sc_process_b::disconnect_process" This method removes this object ins

Check to see if n has any small divisors. For small numbers, we do not have to run the Miller-Rabin primality test. We define "small" to be less than

-------------------------------------------------------------------------- * Print map */ ---------------------------------------------------------

------------------------------------------------------------------------------ "sc_thread_process::enable_process" This method resumes the execution

Compute d, x, and y such that d = gcd( a, b ) = ax + by. x and y can be zero or negative. This algorithm is also Euclid's algorithm but it is extended

was there an event?

------------------------------------------------------------------------------ "sc_runnable::execute_thread_next" This method pushes the the supplied