Math II - ksnctf

How important is modulo arithmetic in cryptography? Let   x = 2748040023408750324411119450523386950660946398855386842074606380418316981389557916980086140301887947706700698930830779678048474