Brute force attacks on hash functions

2007 ◽  
Vol 10 (3) ◽  
pp. 439-460 ◽  
Author(s):  
G. Laccetti ◽  
G. Schmid
Keyword(s):  
2017 ◽  
Vol 8 (2) ◽  
Author(s):  
Andreas Budiman ◽  
Dennis Gunawan ◽  
Seng Hansun

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.


2009 ◽  
Vol 20 (3) ◽  
pp. 682-691
Author(s):  
Pin LIN ◽  
Wen-Ling WU ◽  
Chuan-Kun WU
Keyword(s):  

Author(s):  
Keith M. Martin

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.


1985 ◽  
Vol 20 (12) ◽  
pp. 47-53 ◽  
Author(s):  
Robert W. Sebasta ◽  
Mark A. Taylor
Keyword(s):  

2021 ◽  
Author(s):  
Sa’ed Abed ◽  
Reem Jaffal ◽  
Bassam J. Mohd ◽  
Mohammad Al-Shayeji

Sign in / Sign up

Export Citation Format

Share Document