A Survey of Commercial Password Detection Methods
Zhou Yue,
Ren Fengli,
Shao Yong
Issue:
Volume 7, Issue 2, March 2022
Pages:
18-23
Received:
9 April 2022
Published:
14 April 2022
Abstract: Commercial password has been widely used in China's information services, and their role and importance in information security are gradually increasing. In recent years, as the application of quantum computing in computer technology becomes more and more extensive, the performance of computers continues to improve, and cryptographic penetration technology has emerged in an endless stream. Some known cryptographic algorithms are no longer secure in the new environment, such as the MD5 cryptographic algorithm with obvious security risks and the cracked RSA public key password algorithm, etc. Therefore, it is essential to detect and evaluate the security of commercial passwords. Based on a large number of literature at home and abroad and the practical work experience of Beijing Software Testing and Quality Assurance Center, this study comprehensively analyzes and combs the commercial password detection technology and forms a relatively complete research review on commercial password detection methods. The specific contents include traditional cryptanalysis methods, key penetration attack methods, side-channel attack methods, quantum computing cryptanalysis, etc. The research results provide important theoretical support for the commercial password security detection of the Winter Olympic information system, enhance the technical ability of the inspectors to the commercial password detection, and ensure the comprehensiveness of the information system security detection.
Abstract: Commercial password has been widely used in China's information services, and their role and importance in information security are gradually increasing. In recent years, as the application of quantum computing in computer technology becomes more and more extensive, the performance of computers continues to improve, and cryptographic penetration te...
Show More
New Approach to Solve Assignment Problems with Branch and Bound Algorithm
Farzana Afrin Mim,
Md. Asadujjaman,
Rahima Akter
Issue:
Volume 7, Issue 2, March 2022
Pages:
24-31
Received:
10 March 2022
Accepted:
6 April 2022
Published:
14 April 2022
Abstract: This paper presents a new branch and bound algorithm for solving the assignment problems that uses a lower bound based with branching procedure. This is special type of linear programming problem dealing with the allocation of various resources to the various activities on one to one basis. Most of the business organization operates in traditional and old fashioned manner. Decision making is based on judgment and is quite subjective. Consequently, the entire process of decision making may lead to uncertain and unwanted results. Industries need more scientific and data driven strategies to achieve higher goals and to avoid risks of failure. The assignment problem deals with the maximum profit assigning of jobs or objects to agents such that each job is assigned to precisely one person subject to capacity restrictions on the agents. A new algorithm for the generalized assignment problem is presented that employs both column and row generation and also branch and bound to obtain optimal integer solutions to a set partitioning formulation of the problem. First, a generalized assignment issue that is solved by an existing Hungarian approach that only employs column generation is solved in this study by employing both row and column generation, and the optimal solution is obtained, which is similarly similar. The study is classified according to the objective, solution methodologies and related considerations. This paper hopes to give the reader an idea about the best job assigning that is modeled in this paper, discuss the formulation of assignment problem, its efficacy, enumerate the benefits gained and identify areas for further improvement.
Abstract: This paper presents a new branch and bound algorithm for solving the assignment problems that uses a lower bound based with branching procedure. This is special type of linear programming problem dealing with the allocation of various resources to the various activities on one to one basis. Most of the business organization operates in traditional ...
Show More
