Any maple built-in function can find the possible numbers when modular a fixed number? 

For example, 

(x&^3+y) mod 124 = 123 mod 124

Find the possible values of x and y. 

@Carl Love 

Can you help me to make a 1D plotting by using this data? 

E-_Original_RSA.pdf

If I want to calculate and know the exact time duration of running step 8, do the current algorithm, 

st := time();

elapsed_time := (time() - st)*sec

is good enough? precise enough? or accurate enough? 

Any other recommendations? 

May I know any command that able to support the large number even up to 2000 bits? 

 May I know which commands able to generate large prime up to 2000 bits in maple?