Data Structures and Algorithms

2001 Submissions

[3] viXra:2001.0402 [pdf] submitted on 2020-01-19 19:33:35

A Distributed Algorithm for Brute Force Password Cracking on n Processors

Authors: Roman Bahadursingh
Comments: 3 Pages.

A Password P, can be defined as a hash of x symbols .A brute force password cracking algorithm will go through every possible combination of symbols from 1 – x symbols. This form of password cracker takes O(n) time to solve, where n is the number of possible combinations, achieved by sn where s is the number of symbols available for a password. Having a password cracker with multiple processors, having the processors instead of all checking from symbol 0 to the last symbol, using a more decentralized approach can greatly improve the speed of this computation to O(n/2) for two processors, O(n/3) for three processors and O(n/np) as a generalized formula. This algorithm also allows for multiple processors of different clock speeds to also crack a password in more optimal time.
Category: Data Structures and Algorithms

[2] viXra:2001.0295 [pdf] submitted on 2020-01-15 09:02:31

Coder-Decoder for Open Science Data

Authors: Domenico Oricchio
Comments: 1 Page.

I thought a method to preserve our scientific and cultural knowledge for future generations
Category: Data Structures and Algorithms

[1] viXra:2001.0048 [pdf] submitted on 2020-01-03 22:56:24

Restricted Proof - Upper Bound of the Sum Over All 2^(-|A|), where A is an Edge Cover of a given Graph is in P

Authors: Rikayan Chaki
Comments: Pages.

We consider the sum of all 2^(-|A|), where A is an edge cover of a graph G=(V, E), restricted to cases where |E| < 2|V| - 2. We show that this expression, under the given assumptions, is in P. This means that it is in O(Poly(G)) = O(Poly(V, E))
Category: Data Structures and Algorithms