Efficient implementation of RSA key generation in embedded system

In order to efficiently implement RSA key generation algorithm in embedded system, algorithms involved in key generation are analyzed in detail. Improved trial division algorithm, which detects most of odd composite numbers, is used before primality tests, highly decreasing the frequency of using primality test program and increasing the speed of prime number generation. To implement grea- test common divisor algorithm more efficiently, Euclid algorithm and Binary algorithm are analyzed and compared regarding space and speed, with Euclid algorithm finally adopted. At last, algorithms are optimized based on characteristics of embedded system, which effectively improved the efficiency of RSA key generation.