Modular Arithmetic and Primality
Modular Arithmetic and Primality
Modular Arithmetic and Primality
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Is multiplication O(n 2 )<br />
– Could we come up with a multiplication algorithm which is slower<br />
than O(n 2 )<br />
– Know we can do at least this well, real question is can we come up<br />
with a faster one<br />
Is multiplication Θ(n 2 )<br />
– In other words, is this the best we can do<br />
– Multiplication problem vs particular algorithms<br />
CS 312 - Complexity Examples - <strong>Arithmetic</strong> <strong>and</strong> RSA 16