AUTHOREA
Log in
Sign Up
Browse Preprints
LOG IN
SIGN UP
this is for holding javascript data
RSA for PfT
/
4_What_s_the_rule__.tex
4. What’s the rule for a good enciphering exponent
\((\mod pq)\)
where
\(p\)
and
\(q\)
are primes?
