Title: A new method of large integer prime decomposition for network public key cryptosystem

Authors: Wenbo Sun; Wei Wang; Chenguang Bai

Addresses: College of Sciences, Xi'an Shiyou University, Xi'an, 710065, China ' College of Sciences, Xi'an Shiyou University, Xi'an, 710065, China ' College of Sciences, Xi'an Shiyou University, Xi'an, 710065, China

Abstract: This paper takes prime numbers as the research object. Firstly, a dynamic password authentication scheme based on prime modulus is proposed by using prime modulus as an identity identifier, combined with the Chinese remainder theorem in number theory and RSA public key system, and its security is analysed. Secondly, this paper establishes prime-base linear spaces and corresponding positive rational logarithmic linear spaces. It obtains the matrix of natural logarithmic function linear isomorphism mapping under the corresponding basis through logarithmic isomorphism linear mapping between spaces based on the important role that prime numbers play in theory. Thirdly, by transforming the problem of large integer prime factorisation into the problem of factorisation over polynomial rings, several new methods of large integer prime factorisation based on the theory of polynomial rings are proposed. It provides a theoretical basis for further improving the security of network public key encryption systems.

Keywords: prime base; Chinese remainder theorem; dynamic password; prime factorisation; polynomial ring; cryptosystem.

DOI: 10.1504/IJSN.2024.141784

International Journal of Security and Networks, 2024 Vol.19 No.3, pp.159 - 167

Received: 08 Jul 2024
Accepted: 16 Jul 2024
Published online: 01 Oct 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article