Compiling method and device for program linking

Abstract

Provided are a compiling method and device for program linking, the compiling method comprising: obtaining a file to be linked, and splitting, according to a function or variable symbol in the file, sections in the file to obtain a plurality of input sections (S10); randomly assigning an index value to each of the input sections (S11); and merging, according to the index value of each of the input sections, the corresponding function or variable symbol into a link output file (S12). The compiling method for program linking can further improve randomness of a function and variable symbol in a program by splitting the function and variable symbol in a file and then performing randomization thereon, thereby reducing a possibility of a program being successfully attacked, and improving program security.

Description

technical field [0001] The invention relates to the field of computer technology, in particular to a compiling method and device for program linking. Background technique [0002] With the rapid development of information technology, using a wide open network environment for communication has become the trend of the times. While the network provides development and shared resources, there are inevitably security risks. If there are loopholes in the computer software system (operating system, shared library, middleware, application program), attackers who are familiar with the system can exploit these loopholes through the network. to execute malicious code and perform illegal operations. [0003] A prerequisite for attacking the system is that the attacker has a certain understanding of the system, especially the code address space distribution of the program, and then can control the system by making the process execute the attacker's preset attack code through carefully c...

AI Technical Summary

Problems solved by technology

When the system starts the program, the base address of each component (main program, dynamic library, stack) in the program is randomized. Although such a randomization process is simple to implement and has low overhead, it also has the following problems: ① The granularity is coarse, the address distribution inside the components is still fixed, the attacker can still call the operating system interface, obtain the starting address of each component, and combine brute force and relative addresses to carry out the attack

②It is not flexible enough, either all programs in the system use address randomization, or none of them use address randomization, and this function cannot be enabled according to the characteristics and security requirements of the application itself

③The selection of random numbers is determined by the system, and the generation of some random numbers is also related to the system time. It is easier for an attacker to crack after obtaining the system's random number generation rules and system time

Images