Mystery Box is a box that uses NxN cells. In this mystery box there are a lot of possibilities. This project learn possibilities of NxN mystery box. Processing all posibilities in NxN mystery box will need to long time. To resolve this problem so applied brute force algorithm is one of the algorithms are very detailed, thorough and meticulous in finding and produce all possibilities in mystery box

Cited by 0Open access

Parallel implementations of TSP brute force algorithm

Rafael Almenara Ventura Alves, Cristiana Bentes, Maria Clicia Castro · Cadernos do IME - Série Informática · 2024

The traveling salesman problem is a famous combinatorial optimization problem. Despite its great importance, there is no good exact solution for the generic case. Considering the existence not only of CPUs with many cores but also of GPUs allowing a more generic use and being more popular, this work tries to answer the question: up to what size of problem is it possible to solve in parallel through brute force in a timely manner? For this, implementations were developed in OpenMP, MPI, and CUDA.

Cited by 0Open access

Article Summarizing\nusing Brute Force Algorithm

NUGROHO, GREGORIUS ALPHASELO · Unika Repositor (Unika) · 2015

Automatic text summary is an application that is able to summarize\na text and produce a summary that can be used directly without any process\na summary of the results of the editing, preparation of a summary that takes\nthe most important part of the original text.\nThis project will apply a brute-force algorithm and written in the\nprogramming language PHP, This project uses a brute-force algorithm,\nbrute force algorithm will be used to compare between words in the article\nwith the words stop word and search for key words in the sentence.\nThis project resulted in sentences that only contain keywords only, so\nthat the resulting article discusses a more concise and to the point, Results\nsummary will be displayed in the browser.\nThe resulting software is able to make it easier for user to knowing\nthe essence of the sentence of an article automatically. From the test results\nwe concluded that summary produced more appropriate to the input of a\nnews article

Cited by 0Open access

Brute Force Algorithm Implementation Of Dictionary Search

Charles Baturu, Naufal abdi · Jurnal Info Sains Informatika dan Sains · 2020

In the manual dictionary the more words are accommodated, the heavier the dictionary. Dictionaries that are generally book-shaped are difficult to carry anywhere because they are thick and heavy. With this mobile-based computer dictionary application, users no longer need to carry heavy dictionaries and the search process will also be faster and easier. This mobile-based kmputer dictionary application is created using the java programming language with the NetBeans 7.0 editor and using an RMS (Record Management System) based database. So it can be installed on various types of mobile phones that already support Java. String Matching is one of the algorithms used to speed up the search process for the desired word. String matching algorithms have been used frequently before as examples in the process of matching strings based on the equation of text data namely Brute Force. Because this Brute Force algorithm can be used to perform string or text searches. Brute force algorithm is an algorithm to match a pattern with all text between 0 and n-m to find the presence of a pattern in text.

Cited by 5Open access

Occurrences Algorithm for String Searching Based on Brute-force Algorithm

Ababneh Mohammad, Saleh Oqeili, Rawan A. Abdeen · Journal of Computer Science · 2006

This study proposes a string searching algorithm as an improvement of the brute-force searching algorithm. The algorithm is named as, Occurrences algorithm. It is based on performing preprocessing for the pattern and for the text before beginning to search for the pattern in the text.

Cited by 51Open access

Pseudo-code for the Brute Force NN Algorithm.

Ahmed Shamsul Arefin (136038), Carlos Riveros (139174), Regina Berretta (136049) et al. · Figshare · 2015

The run time complexity of the algorithm is considering a total of query points and reference points in a -dimensional space.

Cited by 0Open access

Building Modern GPU Brute-Force Collision Resistible Hash Algorithm

L. A. Nadeinsky · SHILAP Revista de lepidopterología · 2012

The article considers methods of fixing storing passwords in hashed form security vulnerability. Suggested hashing algorithm is based on the specifics of architecture of modern graphics processors.

Cited by 0Open access

A homogeneous parallel brute force cracking algorithm on the GPU

Anh-Duy Vu, Jea-Il Han, Hong-An Nguyen et al. · 2011

From the early days of computing, passwords have been considered as the essential authentication method to protect accesses to computer systems and users. Due to their importance, sensitiveness and confidentiality, many cryptography mechanisms have been utilized to secure password storage. Among them, cryptography hash methods are the most popular solutions. A cryptography hash function converts plaintext passwords to unreadable message digests which frustrates attackers from exploiting system failures and stealing stored passwords. On the other hand, it is possible to get the plaintext passwords from digests. We examined brute force attack to get the original passwords from the hashed ones and studied some existing GPU-based brute force cracking tools. These applications implement a hybrid algorithm that generates available passwords on CPU side and hashes them in parallel on GPU side. In this paper, we propose a new homogeneous parallel brute force cracking algorithm that performs all the works on GPU side. In our experiments, we successfully cracked many kinds of passwords. For example, with 6-digit passwords, it took about 0.23 ms for initialization, 1.97 ms for combination generation, and 52.81 ms for brute-force. So we need less than 1 second to crack passwords of this kind.

Cited by 12

Brute force attack on block cipher algorithm SMS4 and simulation

Lili Zhang · 2008

Cited by 0

THE EFFECTIVENESS OF THE BRUTE FORCE ALGORITHM FOR PASSWORDS RECOVERY

Feri Sulianta, Ulil Surtia Zulpratita, Ai Rosita · 2020

Security problems, password theft, phishing websites, crackers, hacking threaten information ownership.\nMoreover, passwords with minimal durability which is considered as weak passwords become easy targets for crackers.\nThere are so many method used to break the password for recovery lost. Every method has advantage and disadvantage,\nwhich is depend on condition and situation, including the characteristic of the password which is need to recover. Brute\nforce is one of the oldest method to recover password, and still be used to recover the password for specific needs. In this\nresearch, the Brute Force method will be introduced as a method of recovering and breaking passwords. This method is\neasy to use in guessing passwords even though it takes longer because it is done by tapping a number of keywords. Thus\ncomputer users are more concerned about maintaining the confidentiality of passwords so as not to be easily broken down\nby others, because with a short time the password can be broken.

Cited by 0

A Distributed Algorithm for Brute Force Password Cracking on n Processors

Roman Bahadursingh · viXra · 2020

A distributed brute force algorithm to solve the problem of diminishing returns when more processors are added to a password hash cracking system. Using GBFP, the brute force password cracking algorithm can be greatly reduced in computation time and greatly optimized. This algorithm also helps with the issue of cracking a password hash with many processors with differing clock speeds as well.

Cited by 0Open access

Mitigating Brute Force Attacks Through Algorithm Randomization In Asymmetric Cryptographic System

Mona Z. Saleh, Benny Benyamin Nasution, Mohammad Andri Budiman · 2025

One type of algorithm that is often used to secure data is the asymmetric algorithm, where this algorithm is widely used by business entities and governments to secure data. We know that this algorithm relies on two keys as its security, namely private key and public keys. Even though this algorithm is the main choice for data security, this algorithm has problems that are increasingly getting bigger, namely the increasing size of the public key. In general, this asymmetric algorithm has two keys as its security, but "is it possible if the concept of this asymmetric algorithm has two algorithms that are exchanged between the sender and recipient of the message as security?". In this research, the algorithm created will be randomized every time a transaction or message is exchanged. This is done to prevent cryptanalysts from using brute force methods on the algorithm. The algorithm in this research is named Cryptography Random Algorithm (CRA). With this research, the results are what cryptanalysts need to try to do brute force estimated years, assuming one trial in nanoseconds.

Cited by 0

Distributed Brute-Force Password Recovery with a Partitioned Quantum Grover's Algorithm

Ahcène Bounceur · 2024

In the booming field of quantum computing, Grover's Algorithm emerges as a pivotal quantum search algorithm, theoretically capable of outperforming classical brute-force search methods by exploiting the principles of superposition and quantum parallelism. However, the practical application of Grover's Algorithm to crack complex passwords is limited by the nascent stage of quantum technology, which is currently challenged by limitations in qubit count and coherence times. This paper proposes a novel distributed quantum computing framework that aims to circumvent these limitations by partitioning the search space for a complex password among an array of quantum processors. Each processor executes Grover's Algorithm on a fraction of the total search space, thereby reducing the complexity and quantum resource requirements for each individual computation. The partial results are then transmitted to a central classical computer, which synthesizes them into the final password. This distributed approach not only makes the task feasible for (with) present-day quantum systems but also presents a scalable model that could adapt to the rapid advancements in quantum technologies. By dissecting the complexity of the quantum brute-force problem into smaller, more manageable units, this method holds the potential to significantly reduce the time complexity of password recovery processes and thus presents a profound progress (implications) for the fields of cryptography and cybersecurity.

Cited by 2

A Distributed Algorithm for Brute Force Password Cracking on n Processors

Bahadursingh, Roman · Zenodo (CERN European Organization for Nuclear Research) · 2020

Cited by 0Open access

Analysis Performance BCRYPT Algorithm to Improve Password Security from Brute Force

Toras Pangidoan Batubara, Syahril Efendi, Erna Budhiarti Nababan · Journal of Physics Conference Series · 2021

Abstract The Bcrypt algorithm is a hashing function created from the Blowfish Algorithm by two computer security researchers, Niels Provos and David Mazieres. This hashing function has several advantages, using the original random salt (the salt is the order in which it is added to the password to make it harder to bruteforce). Random salts also prevent lookup table creation. On this basis, the authors try to do a Brute Force experiment on plaintext that has been encrypted by the Bcrypt Algorithm based on 3 characters, namely alphabetic characters, numeric characters and mixed characters to see the security results of the Bcrypt Algorithm. From the results of tests conducted, the alphabetic character with a total of 4 characters can be returned to the original plaintext within 4 days while if the number of 5 characters cannot be found the original plaintext. Then the numeric characters with a total of 7 characters can be found in the original plaintext within 10 hours. Meanwhile, for mixed characters with a total of 7 characters, the original plaintext cannot be found within 5 days. The results of this study indicate that the security performance of the Bcrypt Algorithm is very good in warding off Brute Force attacks for mixed characters while the numeric and alphabetic characters are not good enough.

Cited by 15Open access

GR-461 Sudoku solver using brute force algorithm with backtracking approach

Alam, Md Shamsul, Islam, Md Jahirul, Kommineni, Vyghni Sudha et al. · DigitalCommons - Kennesaw State University (Kennesaw State University) · 2023

Sudoku is a fun game that challenges our brain to think logically. It only has numbers from 1 to 9 in a 9x9 matrix network where the nine numbers should not be repeated in the same column, row or each 3x3 submatrix. Although there are numerous methods to solve this problem, the most common method is the backtracking algorithm. So, we are using brute force algorithm to solve sudoku and then compare it with backtracking to ensure which algorithm gives best results.

Cited by 0