이중 모듈로와 이산 대수 개념에 기반한 비대칭 디지털 서명 알고리즘의 설계 구현
Design and Implementation of an Asymmetric Digital Signature Algorithm Based on Double Modulo and Discrete Logarithm Concepts
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
지난 수십 년 동안 거리의 장벽 없이 정보를 공유하려는 디지털 커뮤니케이션에 대한 관심이 높아졌다. 새로운 기술로 인해 합법적인 프로세스와 불법적인 프로세스가 모두 발전한다. 따라서 값비싼 데이터에 대한 높은 수준의 보호가 필요한 사이버 세계의 애플리케이션은 데이터 보안, 정보 보호 프로세스, 가용성, 개인 정보 보호 및 무결성 분야에서 폭발적인 성장을 가져온다. 그러나 최근 몇 년 동안 다양한 접근 방식을 제공하여 보안 문제를 줄이는 방향으로 많은 연구가 진행되었지만 서로 다른 지형은 별도의 과제를 제기한다. 이러한 맥락에서 보안 문제의 공백을 메우기 위해 본 논문에서는 접근 가능한 암호화 알고리즘, 즉 RSA알고리즘의 성능을 향상시키기 위한 새로운 접근 방식을 제시한다. 제안된 접근 방식은 기존 알고리즘보다 더 효율적이다.
Abstract
Over the past few decades, interest in digital communication has grown to share information without the barrier of distance. New technologies lead to the advancement of both legal and illegal processes. Therefore, applications in the cyber world that require a high level of protection for valuable data result in explosive growth in the areas of data security, information protection processes, availability, privacy and integrity. However, although much research has been done in recent years towards reducing security issues by offering a variety of approaches, different terrains pose separate challenges. In this context, to fill the gap in security issues, this paper presents a new approach to improve the performance of an accessible encryption algorithm, namely the RSA algorithm. The proposed approach is more efficient than existing algorithms. In the case of forward security, we would have to start with a forward secure identification scheme, and then apply to it the same type of transformation described with one main difference. We also have to account for the index of the current time period. But we can easily do so by simply replacing a message in the original case by a pair message-index in our case. Although we do not prove this result, our claim is that forward security will be preserved. The main advantage of such an approach is that we can obtain a signature scheme which is forward secure based solely on the security of the corresponding identification scheme. Moreover, the lengths of both the secret and public keys are independent of the total number of time periods.
참고문헌 (17)
- W. Stallings, "Cryptography and network security", pp.42~297, Pearson Education
- A. Kahate, "Cryptography and network security", pp.38~370, McGraw-Hill Publishing Company Limited
- R. Rivest, "A method for obtaining digital signatures and public-key cryptosystems", Communications of the ACM, 21(2), pp.120~126 (1978)
- H. Jingxin, "A new forward-secure digital signature scheme", IEEE International Workshop on Anti counterfeiting, Security, Identification, pp.254~257 (2007)
- B. Poe, "Factoring the RSA algorithm, Mat", CSC 494, 2005, pp.1~6
- R. E. Smith, "Internet cryptography", pp.33~85, Pearson Education
- C. M. King, "Security architecture design, deployment & operations", pp.91~370, McGraw-Hill Publishing Company Limited
- A. Mousa, "Sensitivity of changing the RSA parameters on the complexity and performance of the algorithm", Journal of Applied Science, pp.60~63 (2005), Asian Network for Scientific Information
- L. X. Fei, "An improved ElGamal digital signature algorithm based on adding a random number", Second International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC), 2, pp.236~240 (2010)
- E. S. Ismail, "A new signature scheme based on multiple hard Number Theoretic Problems", ISRN Communications and Networking, 2011 (2011)
- W. Rao, "The performance analysis of two digital signature schemes based on secure charging protocol", International Conference on Wireless Communications, Networking and Mobile Computing, 2, pp.1180~1182 (2005)
- S. Verma, "A new digital signature scheme based on two hard problems", Int. J. Pure Appl. Sci. Technol, 5(2), pp.55~59 (2011)
- C-A. Zhao, "Computing bilinear pairing on elliptic curves with automorphisms", Des. Codes Cryptogr, 58, pp.35~44 (2011)
- S. Vishnoi, "A new digital signature algorithm based on factorization and discrete logarithm problem", International Journal of Computer Trends and Technology, 3(4), pp.653~657 (2012)
- Z. Shao, "Security of a new digital signature scheme based on factoring and discrete logarithms", International Journal of Computer Mathematics, 82(10), pp.1215~1219 (2005)
- K. Madhur, "Vijay, Modified ElGamal over RSA digital signature algorithm (MERDSA)", International Journal of Advanced Research in Computer Science and Software Engineering, 2(8), pp.289~293 (2012)
- G. Karagiorgos, "Efficient algorithms for the basis of finite abelian groups, Discrete Mathematics", Algorithms and Applications, 3(4), pp.537~552 (2012)