Fig. 1. Comparison of the running time of TD-MR, DT-MR and ET-MR. 그림 1. TD-MR, DT-MR, ET-MR의 수행시간 비교
Fig. 2. Comparison of the memory usage of TD-MR, DT-MR and ET-MR. 그림 2. TD-MR, DT-MR, ET-MR의 메모리사용량 비교
Fig. 3. Comparison of the running time of TD-MR-MR, DT-MR-MR and ET-MR-MR. 그림 3. TD-MR-MR, DT-MR-MR, ET-MR-MR의 메모리 사용량 비교
Fig. 4. Comparison of the memory usage of TD-MR-MR, DT-MR-MR and ET-MR-MR 그림 4. TD-MR-MR, DT-MR-MR, ET-MR-MR의 메모리 사용량 비교
Table 1. An example of duplicate operations in DT. 표 1. DT에서 중복판단하는 예시
Table 2. Comparison of the theoretical time and measured time of ET-MR. 표 2. ET-MR의 이론시간과 실제시간의 비교
Table 3. Comparison of the theoretical time and measured time of ET-MR-MR. 표 3. ET-MR-MR의 이론시간과 실제시간의 비교
Table 4. The running time comparison of TD-MR, DT-MR, ET-MR. 표 4. TD-MR, DT-MR, ET-MR의 수행시간비교
Table 5. Comparison of memory usage of TD-MR, DT-MR, ET-MR. 표 5. TD-MR, DT-MR, ET-MR의 메모리 사용량 비교
Table 6. The running time comparison of TD-MR-MR, DT-MR-MR, ET-MR-MR. 표 6. TD-MR-MR, DT-MR-MR, ET-MR-MR의 수행시간비교
Table 7. Comparison of memory usage of TD-MR-MR, DT-MR-MR, ET-MR-MR. 표 7. TD-MR-MR, DT-MR-MR, ET-MR-MR의 메모리 사용량 비교
References
- Changhun Jung, Daehong Min, DaeHun Nyang and KyungHee Lee, "A Proposal of One-Time Password Authentication Protocol using DigitalSeal," The Journal of Korean Institute of Next Generation Computing, Vol.14, No.4, pp.45-57, 2018.
- Jin Bok Kim, Tae Youn Han and Mun-Kyu Lee, "Authentication of smart phone users based on composite stage information," The Journal of Korean Institute of Next Generation Computing, Vol.7, No.5, pp.4-12, 2011.
- Rivest, R. L. and Shamir, A. and Adleman, L., "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, Vol.21, No.2, pp.120-126, 1978. DOI: 10.1145/359340.359342
- ElGamal, T., "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," IEEE Transactions on information Theory, Vol. IT-31, No.4, pp.469-472, 1985. DOI: 10.1007/3-540-39568-7_2
- Stallings, W., Cryptography and Network Security Principles and Practices, 4th ed, Prentice Hall. 2005.
- Cormen T. H., Leiserson C. E. and Rivest R. L. and Stein, C., Introduction to Algorithms, 3rd ed, MIT press. 2009.
- Miller, G. L., "Riemann's Hypothesis and Tests for Primality," Journal of Computer Systems Science, Vol.13. No.3. pp.300-317. 1976. DOI: 10.1016/S0022-0000(76)80043-8
- Menezes, A. J. and van Oorschot, P. C. and Vanstone, S. A., Handbook of Applied Cryptography, CRC Press. 1996.
- Hosung Jo, Heejin Park, "Probabilistic Analysis of Incremental Random Number Generation using Division Tables," 2013 Fall Korea Software Congress, pp.1330-1332, 2013.
- Maurer, U. M., "Fast generation of prime numbers and secure public-key cryptographic parameters," Journal of Cryptology, Vol.8. No.3. pp.123-155. 1995. DOI: 10.1007/BF00202269
- Heejin Park and Dongkyu Kim, "Probabilistic Analysis on the Optimal Combination of Trial Division and Probabilistic Primality Tests for Safe Prime Generation," IEICE TRANSACTIONS on Information and Systems, Vol.E94-D. No.6. pp.1210-1215. 2011. DOI: 10.1587/transinf.E94
- Changgi Kim, Hosung Jo, Heejin Park "Probabilistic Analysis of Prime and Safe-prime Generation with Division Table," The Journal of Korean Institute of Next Generation Computing, Vol.12, Issue6, pp.82-91, 2016.