Brute-Force Search Your Way to a Good Strategy

2018 ◽  
Keyword(s):  
Brute Force ◽  
Good Strategy ◽  
Brute Force Search

scholarly journals Secure Remote User Authentication using Pass Script & Pass Text

2019 ◽  
Vol 8 (4) ◽  
pp. 4411-4417
Keyword(s):  
Smart Card ◽  
Mobile Device ◽  
User Authentication ◽  
Brute Force ◽  
Brute Force Search ◽  
Secure Systems ◽  
Graphical Passwords ◽  
Remote User Authentication ◽  
Remote User

Authenticating users to secure systems is a crucial task for security experts to solve a password problem, where user should able to memorize a password or secret and password should be hard to guess and crack by adversaries. In general, Most of the secure systems were designed with text passwords along with additional factors such as tokens like smart card, mobile device. Text passwords are not resistant to dictionary, brute-force and guessing attacks. This paper proposes a novel graphical password method, which solves the password problem and secure against all password vulnerabilities. Theoretically, graphical passwords are easy to memorize and recall them easily for long term and resistant to dictionary and brute-force search attacks

scholarly journals A Classical Mechanism for Shor's Algorithm Implementations

2018 ◽  
Vol 10 (4) ◽  
pp. 24
Author(s):  
David L. Selke
Keyword(s):  
Random Number ◽  
Random Number Generation ◽  
Brute Force ◽  
Design Intent ◽  
Brute Force Search ◽  
Number Generation ◽  
Shor's Algorithm ◽  
Classical Mechanism

Loops that enforce a correct output and that restart with a changed parameter may emulate a brute force search, even against the design intent. A Python program is presented analogous to Shor's Algorithm but with random number generation replacing the math. It factors integers. Shor's Algorithm devices may operate similarly to the Python program, not in being random, but in being classical.

scholarly journals Generation of macro-operators via investigation of action dependencies in plans

2010 ◽  
Vol 25 (3) ◽  
pp. 281-297 ◽  
Author(s):  
Lukáš Chrpa
Keyword(s):  
Brute Force ◽  
Search Methods ◽  
Brute Force Search ◽  
Useful Knowledge ◽  
Planning Algorithms ◽  
Planning Problems ◽  
Complex Planning

AbstractThere are many approaches for solving planning problems. Many of these approaches are based on ‘brute force’ search methods and they usually do not care about structures of plans previously computed in particular planning domains. By analyzing these structures, we can obtain useful knowledge that can help us find solutions to more complex planning problems. The method described in this paper is designed for gathering macro-operators by analyzing training plans. This sort of analysis is based on the investigation of action dependencies in training plans. Knowledge gained by our method can be passed directly to planning algorithms to improve their efficiency.

scholarly journals THE PARALLEL IMPLEMENTATION OF ALGORITHMS FOR FINDING THE REFLECTION SYMMETRY OF THE BINARY IMAGES

2017 ◽  
Vol XLII-2/W4 ◽  
pp. 179-184
Author(s):  
S. Fedotova ◽  
O. Seredin ◽  
O. Kushnir
Keyword(s):  
Symmetry Axis ◽  
Parallel Implementation ◽  
Search Algorithm ◽  
Experimental Studies ◽  
Ground Truth ◽  
Approximate Symmetry ◽  
Brute Force ◽  
Brute Force Search ◽  
Binary Images ◽  
The Common

In this paper, we investigate the exact method of searching an axis of binary image symmetry, based on brute-force search among all potential symmetry axes. As a measure of symmetry, we use the set-theoretic Jaccard similarity applied to two subsets of pixels of the image which is divided by some axis. Brute-force search algorithm definitely finds the axis of approximate symmetry which could be considered as ground-truth, but it requires quite a lot of time to process each image. As a first step of our contribution we develop the parallel version of the brute-force algorithm. It allows us to process large image databases and obtain the desired axis of approximate symmetry for each shape in database. Experimental studies implemented on “Butterflies” and “Flavia” datasets have shown that the proposed algorithm takes several minutes per image to find a symmetry axis. However, in case of real-world applications we need computational efficiency which allows solving the task of symmetry axis search in real or quasi-real time. So, for the task of fast shape symmetry calculation on the common multicore PC we elaborated another parallel program, which based on the procedure suggested before in (Fedotova, 2016). That method takes as an initial axis the axis obtained by superfast comparison of two skeleton primitive sub-chains. This process takes about 0.5 sec on the common PC, it is considerably faster than any of the optimized brute-force methods including ones implemented in supercomputer. In our experiments for 70 percent of cases the found axis coincides with the ground-truth one absolutely, and for the rest of cases it is very close to the ground-truth.

scholarly journals Exact Method for Generating Strategy-Solvable Sudoku Clues

Algorithms ◽  
2020 ◽  
Vol 13 (7) ◽  
pp. 171
Author(s):  
Kohei Nishikawa ◽  
Takahisa Toda
Keyword(s):  
Time Limit ◽  
Exact Method ◽  
Limit Set ◽  
Brute Force ◽  
Regular Pattern ◽  
Brute Force Search ◽  
Running Time ◽  
Minimum Number ◽  
Rigorous Framework

A Sudoku puzzle often has a regular pattern in the arrangement of initial digits and it is typically made solvable with known solving techniques called strategies. In this paper, we consider the problem of generating such Sudoku instances. We introduce a rigorous framework to discuss solvability for Sudoku instances with respect to strategies. This allows us to handle not only known strategies but also general strategies under a few reasonable assumptions. We propose an exact method for determining Sudoku clues for a given set of clue positions that is solvable with a given set of strategies. This is the first exact method except for a trivial brute-force search. Besides the clue generation, we present an application of our method to the problem of determining the minimum number of strategy-solvable Sudoku clues. We conduct experiments to evaluate our method, varying the position and the number of clues at random. Our method terminates within 1 min for many grids. However, as the number of clues gets closer to 20, the running time rapidly increases and exceeds the time limit set to 600 s. We also evaluate our method for several instances with 17 clue positions taken from known minimum Sudokus to see the efficiency for deciding unsolvability.

Automated Cryptanalysis

2011 ◽  
pp. 179-185
Author(s):  
Otokar Grošek ◽  
Pavol Zajac
Keyword(s):  
Natural Language ◽  
Scoring Function ◽  
Brute Force ◽  
Brute Force Search ◽  
Key Space

Classical ciphers are used to encrypt plaintext messages written in a natural language in such a way that they are readable for sender or intended recipient only. Many classical ciphers can be broken by brute-force search through the key-space. One of the pertinent problems arising in automated cryptanalysis is the plaintext recognition. A computer should be able to decide which of many possible decrypts are meaningful. This can be accomplished by means of a text scoring function, based, e.g. on n-grams or other text statistics. A scoring function can also be used in conjunction with AI methods to speedup cryptanalysis.

Brute Force Search Method for Cyberbullying Detection

2020 ◽  
pp. 339-384
Author(s):  
Michal E. Ptaszynski ◽  
Fumito Masui
Keyword(s):  
Automatic Detection ◽  
Search Algorithms ◽  
Search Method ◽  
Brute Force ◽  
Combinatorial Approach ◽  
Brute Force Search ◽  
Pros And Cons ◽  
The One ◽  
Cyberbullying Detection ◽  
Language Classification

In this chapter, the authors present a method for automatic detection of malicious internet contents, based on a combinatorial approach resembling brute force search algorithms, with application to language classification. The method automatically extracts sophisticated patterns from sentences and applies them in classification. The experiments performed on actual cyberbullying data showed advantage of this method to previous methods, including the one described in Chapter 4. Pros and cons of this method when compared to previous ones are also discussed in this chapter.

Sign in / Sign up

Export Citation Format

Share Document