Fast Approximate String Search for Wikification

Implementing a faster string search algorithm in Ada

ACM SIGAda Ada Letters ◽

10.1145/44772.44777 ◽

1988 ◽

Vol VIII (3) ◽

pp. 87-97

Author(s):

P. Wood ◽

D. Turcaso

Keyword(s):

Search Algorithm ◽

String Search

Download Full-text

Clustering digital forensic string search output

Digital Investigation ◽

10.1016/j.diin.2014.10.002 ◽

2014 ◽

Vol 11 (4) ◽

pp. 314-322 ◽

Cited By ~ 9

Author(s):

Nicole L. Beebe ◽

Lishu Liu

Keyword(s):

Digital Forensic ◽

String Search

Download Full-text

Algorithm Implementation Crochemore Perrin On The Dictionary Application Of Latin Terms Flora And Fauna Based On Android

Journal Of Computer Networks, Architecture and High Performance Computing ◽

10.47709/cnapc.v2i1.379 ◽

2020 ◽

Vol 2 (1) ◽

pp. 140-148

Author(s):

Bobby Aris Sandy ◽

Paska Marto Hasugian

Keyword(s):

String Matching ◽

Smartphone Application ◽

Search Method ◽

Search Process ◽

Smartphone Applications ◽

Matching Process ◽

Data Search ◽

String Search ◽

Algorithm Implementation ◽

Very High

Searching is the process of selecting the information needed from a collection of data that already exists, data search is often also called a tablelook-up or store and retrieval information. Along with the development of technology that is now so very rapid, one of them is the Smartphone application. Smartphone applications that are currently in demand are increasing sharply, that is Android. Even though the presentation is limited to the screen, Smartphones are quite efficient for its users where the mobility is very high and affordable in all circles of society. used is the string search method. String search method is a string search process or often also called string matching. In the string matching process, there is the Crochemore perrin algorithm, which is an algorithm that factoring a pattern into two parts, namely Pattrenkiri and pattern right. This method is perfect for dictionary search applications of Latin terms flora and fauna.

Download Full-text

Detection of the Hardcoded Login Information from Socket and String Compare Symbols

Annals of Emerging Technologies in Computing ◽

10.33166/aetic.2021.01.003 ◽

2021 ◽

Vol 5 (1) ◽

pp. 28-39

Author(s):

Minami Yoda ◽

Shuji Sakuraba ◽

Yuichi Sei ◽

Yasuyuki Tahara ◽

Akihiko Ohsuga

Keyword(s):

Internet Of Things ◽

Static Analysis ◽

Real World ◽

Symbolic Execution ◽

The Internet ◽

User Input ◽

Network Function ◽

Private Data ◽

String Search ◽

Iot Devices

Internet of Things (IoT) for smart homes enhances convenience; however, it also introduces the risk of the leakage of private data. TOP10 IoT of OWASP 2018 shows that the first vulnerability is ”Weak, easy to predict, or embedded passwords.” This problem poses a risk because a user can not fix, change, or detect a password if it is embedded in firmware because only the developer of the firmware can control an update. In this study, we propose a lightweight method to detect the hardcoded username and password in IoT devices using a static analysis called Socket Search and String Search to protect from first vulnerability from 2018 OWASP TOP 10 for the IoT device. The hardcoded login information can be obtained by comparing the user input with strcmp or strncmp. Previous studies analyzed the symbols of strcmp or strncmp to detect the hardcoded login information. However, those studies required a lot of time because of the usage of complicated algorithms such as symbolic execution. To develop a lightweight algorithm, we focus on a network function, such as the socket symbol in firmware, because the IoT device is compromised when it is invaded by someone via the Internet. We propose two methods to detect the hardcoded login information: string search and socket search. In string search, the algorithm finds a function that uses the strcmp or strncmp symbol. In socket search, the algorithm finds a function that is referenced by the socket symbol. In this experiment, we measured the ability of our proposed method by searching six firmware in the real world that has a backdoor. We ran three methods: string search, socket search, and whole search to compare the two methods. As a result, all methods found login information from five of six firmware and one unexpected password. Our method reduces the analysis time. The whole search generally takes 38 mins to complete, but our methods finish the search in 4-6 min.

Download Full-text

APLIKASI PENDETEKSI PLAGIARISME TUGAS DAN MAKALAH PADA SEKOLAH MENGGUNAKAN ALGORITMA RABIN KARP

Jurnal Algoritma, Logika dan Komputasi ◽

10.30813/j-alu.v1i1.1104 ◽

2018 ◽

Vol 1 (1) ◽

Author(s):

Danny Steveson ◽

Halim Agung ◽

Fendra Mulia

Keyword(s):

Search Algorithm ◽

Sentence Similarity ◽

String Search ◽

Frequent Problem ◽

Sørensen Index

Plagiarism is a very frequent problem in all aspects of one occurring in school. There is often plagiarism on the content of the papers or assignments collected by the students. This is to support the decreasing creativity of students in giving ideas and personal opinions on the task given. To answer the above problems then this research using Rabin-Karp algorithm. Rabin-Karp algorithm is a string search algorithm that uses hashing to find one of a series of string patterns in text. Using this application, the user can compare document 1 with another document, which gives results in sentence similarity, then spelled out per word, followed by per hashing and is calculated from the average number of percentages. The test in this research is done by taking samples 50 times and in comparison between percentage with Rabin Karp algorithm and percentage with manual taking. Testing is done by comparing one document with another document. Based on the result of the research, it can be concluded by using Rabin Karp Algorithm, which can be implemented in plagiarism application evidenced by the test using 50 test samples with 43 samples of success of 14.22%.<br />Keywords: document , Rabin Karp Algorithm, Dice Sorensen Index, Plagiarism, sentence, word

Download Full-text