Number Theory T wo ancient problems
Factoring Given a number N express it as a product of its prime factors Primality Given a number N determine whether it is a prime Factoring is hard Despite centuries of efforts the fastest methods for factoring a number N take time exponential in number of bits of N
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Number Theory T wo ancient problems" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.