scholarly journals Security Design Pattern for Login System through Authentication using Modified Sha-384 Algorithm

2021 ◽  
Vol 10 (8) ◽  
pp. 68-73
Author(s):  
Yogini C. Kulkarni ◽  
S.D. Joshi
Keyword(s):  
Execution Time ◽  
Design Pattern ◽  
Security Design ◽  
Brute Force ◽  
Registration Form ◽  
Rainbow Table ◽  
Cain And Abel ◽  
Generic Attacks ◽  
Modified Algorithm

The research has been carried out to develop secure login system by authenticating the login using modified SHA-384 algorithm. It derives 896-bit hash value for the password entered by the user in the user registration form and saves the credentials entered by the user in system’s database. Results obtained are evaluated by resolving the general attacks confirmed that the modified SHA-384 algorithm was more secured compared to the original SHA-384 algorithm as it was not broken using generic attacks such as brute force, rainbow table and other cracking tools available online such as Cain and Abel. The performance of the modified algorithm was measured with only 2 ms additional execution time from SHA-384.

scholarly journals Search via quantum walks with intermediate measurements

2015 ◽  
Vol 29 (19) ◽  
pp. 1550127
Author(s):  
Efrain Buksman ◽  
André L. Fonseca de Oliveira ◽  
Jesús García López de Lacalle
Keyword(s):  
Close Relationships ◽  
Search Algorithm ◽  
Quantum Algorithms ◽  
Quantum Walks ◽  
Quantum Search ◽  
Brute Force ◽  
Correlation Measure ◽  
Quantum Search Algorithm ◽  
Control Qubit ◽  
Modified Algorithm

A modification of Tulsi's quantum search algorithm with intermediate measurements of the control qubit is presented. In order to analyze the effect of measurements in quantum searches, a different choice of the angular parameter is used. The study is performed for several values of time lapses between measurements, finding close relationships between probabilities and correlations (mutual information and cumulative correlation measure). The order of this modified algorithm is estimated, showing that for some time lapses the performance is improved, and becomes of order O(N) (classical brute-force search) when measurements are taken in every step. The results provide a possible way to analyze improvements to other quantum algorithms using one, or more, control qubits.

TESEM: A Tool for Verifying Security Design Pattern Applications by Model Testing

2015 ◽  
Author(s):  
Takanori Kobashi ◽  
Masatoshi Yoshizawa ◽  
Hironori Washizaki ◽  
Yoshiaki Fukazawa ◽  
Nobukazu Yoshioka ◽  
...  
Keyword(s):  
Design Pattern ◽  
Model Testing ◽  
Security Design

scholarly journals Research and Development of an Algorithm for the Response Time Estimation in Multiprocessor Systems Under the Interval Uncertainty of the Tasks Execution Times

2020 ◽  
Vol 27 (2) ◽  
pp. 218-233
Author(s):  
Mark G. Gonopolskiy ◽  
Alevtina B. Glonina
Keyword(s):  
Response Time ◽  
Execution Time ◽  
Interval Uncertainty ◽  
Time Interval ◽  
Multiprocessor Systems ◽  
Brute Force ◽  
Worst Case ◽  
Force Method ◽  
Brute Force Method ◽  
Execution Times

The paper presents an algorithm for the worst case response time (WCRT) estimation for multiprocessor systems with fixed-priority preemptive schedulers and the interval uncertainty of tasks execution times. Each task has a unique priority within its processor, a period, an execution time interval [BCET, WCET] and can have data dependency on other tasks. If a decrease in the execution time of the task A can lead to an increase in the response time of the another task B, then task A is called an anomalous task for task B. According to the chosen approach, in order to estimate a task’s WCRT, two steps should be performed. The first one is to construct a set of anomalous tasks using the proposed algorithm for the given task. The paper provides the algorithm and the proof of its correctness. The second one is to find the WCRT estimation using a genetic algorithm. The proposed approach has been implemented software as a program in Python3. A set of experiments have been carried out in order to compare the proposed method in terms of precision and speed with two well-known WCRT estimating methods: the method that does not take into account interval uncertainty (assuming that the execution time of a given task is equal to WCET) and the brute force method. The results of the experiments have shown that, in contrast to the brute force method, the proposed method is applicable to the analysis of the real scale computing systems and also allows to achieve greater precision than the method that does not take into account interval uncertainty.

scholarly journals Merkle-Damgård Construction Method and Alternatives

2017 ◽  
Vol 41 (2) ◽  
pp. 283-304 ◽  
Author(s):  
Harshvardhan Tiwari
Keyword(s):  
Information Security ◽  
Hash Function ◽  
Hash Functions ◽  
Construction Method ◽  
Security Requirements ◽  
Security Design ◽  
Compression Function ◽  
Cryptographic Hash Function ◽  
Initialization Vector ◽  
Generic Attacks

Cryptographic hash function is an important cryptographic tool in the field of information security. Design of most widely used hash functions such as MD5 and SHA-1 is based on the iterations of compression function by Merkle-Damgård construction method with constant initialization vector. Merkle-Damgård construction showed that the security of hash function depends on the security of the compression function. Several attacks on Merkle-Damgård construction based hash functions motivated researchers to propose different cryptographic constructions to enhance the security of hash functions against the differential and generic attacks. Cryptographic community had been looking for replacements for these weak hash functions and they have proposed new hash functions based on different variants of Merkle-Damgård construction. As a result of an open competition NIST announced Keccak as a SHA-3 standard. This paper provides a review of cryptographic hash function, its security requirements and different design methods of compression function.

scholarly journals Using Improved d-HMAC for Password Storage

2017 ◽  
Vol 10 (3) ◽  
pp. 1 ◽  
Author(s):  
Mohannad Najjar
Keyword(s):  
Public Key ◽  
Message Authentication ◽  
Brute Force ◽  
Message Authentication Code ◽  
Dictionary Attack ◽  
Authentication Code ◽  
Rainbow Table ◽  
Brute Force Attack ◽  
Dynamic Key ◽  
Improved Algorithm

Password storage is one of the most important cryptographic topics through the time. Different systems use distinct ways of password storage. In this paper, we developed a new algorithm of password storage using dynamic Key-Hashed Message Authentication Code function (d-HMAC). The developed improved algorithm is resistant to the dictionary attack and brute-force attack, as well as to the rainbow table attack. This objective is achieved by using dynamic values of dynamic inner padding d-ipad, dynamic outer padding d-opad and user’s public key as a seed.

scholarly journals Modification of the algorithm based on the Feistel network by adding an element of randomness into the encryption key

2021 ◽  
pp. 81-88
Author(s):  
Pavel Chernov ◽  
◽  
Aleksander Shkaraputa ◽  
Keyword(s):  
Building Block ◽  
Execution Time ◽  
Block Ciphers ◽  
Time Increase ◽  
Encrypted Data ◽  
Hamming Codes ◽  
Advantages And Disadvantages ◽  
Modified Algorithm

The article revealed the research of methods for constructing block ciphers and its advantages and disadvantages. The modified algorithm based on the Feistel network using Hamming codes and adding an element of randomness into the encryption key was proposed. Analysis of the main arameters of the algorithm in comparison with Feistel network was performed: resistance to cryptanalysis, execution time, increase in the volume of encrypted data. The analysis revealed the stronger resistance to cryptanalysis than the Feistel network, increased execution time and volume of encrypted data. The potential for building block ciphers based on the algorithm was explored.

scholarly journals Security Modeling for Web Based Visitor‘s Login System for Pursuance of Security Design Pattern

2019 ◽  
Vol 9 (1) ◽  
pp. 982-991
Keyword(s):  
Software Development ◽  
Design Pattern ◽  
Early Stage ◽  
Quality Parameters ◽  
Security Requirements ◽  
Design Parameters ◽  
Design Decision ◽  
Security Design ◽  
Final Design ◽  
Use Of Internet

In recent years because of the widespread use of internet and other communication media security occurrences have broken all the barricades. System gets attacked by malicious attackers and various cyber criminalities. Every system should be built by taking security as a main priority while building a system so as to make it reliable, safety and also it should be enhanced with other quality parameters. Hence since beginning at every phase of software development till the implementation of the software, security aspect is needed to take into consideration before making the final design decision to avoid the expenses which may incur while recovering of the system after the damage. For attainment of this, it is must to integrate the security at each phase of the software development. The software developers insists on incorporating the software safeguards at the design phase which may wind up in identifying the architecture restrictions related with the security which in fact may not be necessary. To reduce this problem, this paper intends a structure for security development activities. These activities consist of security requirements identification and threats analysis which are to be converted into design decisions to lessen the risks to identified important assets. The recognized design parameters are then manually prioritized using VOSREP and CRAMM and accordingly Security design pattern is to be developed to incorporate security in the software. By manually calculating values of assets and prioritizing will help to identify the security requirements at the early stage of the software development life cycle. Accordingly the decisions for developing the security design pattern are to be taken for building the software system

Sign in / Sign up

Export Citation Format

Share Document