Resilience against brute force and rainbow table attacks using strong ICMetrics session key pairs

Notice of Retraction-----------------------------------------------------------------------After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of APTIKOM's Publication Principles.We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.The presenting author of this paper has the option to appeal this decision by contacting ij.aptikom@gmail.com.----------------------------------------------------------------------- In this paper, tree parity synchronized session key validation followed by encryption has been proposed for online data communication. Tree Parity Machine transmitting systems at both ends accepted an identical input vector, generated an output bit, validated the weight vector and the networks were trained accordingly based on the output bit which was used to form a protected variable length secret key. Existence of a better degree of coupling between the two topological same tree parity machines has been reflected in this paper. Instead of sharing the entire weight vector, the proposed technique guided the partial transmission and validation of session key. A string of sub key has been derived from the synchronized session key for initial ciphering matrix. The plain text was encrypted through single columnar transposition ciphering at first round of encryption followed by successive cascaded XORing of TPM generated session key. If size of the final block of plain text was less than the size of the key then this block was treated unaltered. Recipient used identical generated session key for performing deciphering process for getting the plain text. Brute force attacks analysis has been implemented which determines a higher amount of time to decrypt by the intruders. Such long computational operations were not feasible by any of randomly selected fast networks at the intruders’ terminals.

Download Full-text

Using Improved d-HMAC for Password Storage

Computer and Information Science ◽

10.5539/cis.v10n3p1 ◽

2017 ◽

Vol 10 (3) ◽

pp. 1 ◽

Cited By ~ 2

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.

Download Full-text

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

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.h9244.0610821 ◽

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.

Download Full-text

Breakout Session Key Concepts on Engineering Methods for Precipitation under a Changing Climate

Engineering Methods for Precipitation under a Changing Climate ◽

10.1061/9780784415528.ch08 ◽

2020 ◽

pp. 123-128

Author(s):

Robert Fields ◽

Kelcy T. Adamec

Keyword(s):

Breakout Session ◽

Session Key ◽

Changing Climate ◽

Key Concepts

Download Full-text

Implementasi Algoritma Hamming Distance dan Brute Force dalam Mendeteksi Kemiripan Source Code Bahasa Pemrograman C

Jurnal ULTIMATICS ◽

10.31937/ti.v8i2.514 ◽

2017 ◽

Vol 8 (2) ◽

Author(s):

Andreas Budiman ◽

Dennis Gunawan ◽

Seng Hansun

Keyword(s):

College Presidents ◽

Hamming Distance ◽

Source Code ◽

Structural Type ◽

Brute Force ◽

Important Thing ◽

The Past ◽

Index Terms ◽

Better Than

Plagiarism is a behavior that causes violence of copyrights. Survey shows 55% of college presidents say that plagiarism in students’ papers has increased over the past 10 years. Therefore, an application for detecting plagiarism is needed, especially for teachers. This plagiarism checker application is made by using Visual C# 2010. The plagiarism checker uses hamming distance algorithm for matching line code of the source code. This algorithm works by matching the same length string of the code programs. Thus, it needs brute will be matched with hamming distance. Another important thing for detecting plagiarism is the preprocessing, which is used to help the algorithm for detecting plagiarized source code. This paper shows that the application works good in detecting plagiarism, the hamming distance algorithm and brute force algorithm works better than levenstein distance algorithm for detecting structural type of plagiarism and this thesis also shows that the preprocessing could help the application to increase its percentage and its accuracy. Index Terms—Brute Force, Hamming Distance, Plagiarisme, Preprocessing.

Download Full-text