... difficult as the problem offactoring a large integer into itsprime factorsAnother intractable problem that appears to have useful properties that we can use to build a cryptosystem upon is the difficulty ... for greatest common denominator – the largest prime factor that two numbers have in common. So, to evaluate gcd(9, 12), we break 9 down into all possible integer factors (1, 3, 9) and do the ... 6Introduction to Encryption II – SANS GIAC LevelOne ©2000, 20016Concepts in Cryptography 3Example: RSA• based on difficulty offactoring a large integerinto its prime factors• ~1000 times...