오일러체를 적용한 소수와 안전소수의 생성법 제안과 분석

초록

As the IoT-based hyper-connected society grows, public-key cryptosystem such as RSA is frequently used forencryption, authentication, and digital signature. Public-key cryptosystem use very large (safe) prime numbers toensure security against malicious attacks. Even though the performance of the device has greatly improved, thegeneration of a large (safe)prime is time-consuming or memory-intensive. In this paper, we propose ET-MR andET-MR-MR using Euler sieve so it runs faster while using less memory. We present a running time prediction modelby probabilistic analysis and compare time and memory of our method with conventional methods. Experimentalresults show that the difference between the expected running time and the measured running time is less than 4%. In addition, the fastest running time of ET-MR is 36% faster than that of TD-MR, 8.5% faster than that of DT-MRand the fastest running time of ET-MR-MR is 65.3% faster than that of TD-MR-MR and similar to that ofDT-MR-MR. When k=12,381, the memory usage of ET-MR is 2.7 times more than that of DT-MR but 98.5% lessthan that of TD-MR and when k=65,536, the memory usage of ET-MR-MR is 98.48% less than that of TD-MR-MRand 92.8% less than that of DT-MR-MR.

키워드